Graphs with unique minimum semitotal dominating sets (Q7001522)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8023053
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs with unique minimum semitotal dominating sets |
scientific article; zbMATH DE number 8023053 |
Statements
Graphs with unique minimum semitotal dominating sets (English)
0 references
7 April 2025
0 references
The authors of this paper investigate semitotal dominating sets, by which they mean a dominating set of a graph \(G\) with the property that every vertex of it is within distance 2 of another vertex of it. They prove certain existential results and derive some bounds for the semitotal domination number (the minimum cardinality of a semitotal dominating set in \(G\)) on a connected graph \(G\). They also characterize the infinite families of graphs that attain equality for those bounds.
0 references
domination
0 references
edge weighting function
0 references
minimum degree
0 references
semitotal domination
0 references
