Graphs with unique minimum semitotal dominating sets
From MaRDI portal
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.
Cites work
- Algorithmic aspects of semitotal domination in graphs
- Bounds on domination parameters in graphs: a brief survey
- Domination and location in acyclic graphs
- Edge weighting functions on semitotal dominating sets
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- On matching and semitotal domination in graphs
- On matching and total domination in graphs
- On the semitotal domination number of line graphs
- Semitotal domination in claw-free cubic graphs
- Semitotal domination in claw-free cubic graphs
- Semitotal domination in graphs
- Total domination in graphs
- Trees with unique minimum semitotal dominating sets
This page was built for publication: Graphs with unique minimum semitotal dominating sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7001522)
