The total bondage numbers and efficient total dominations of vertex-transitive graphs
From MaRDI portal
Publication:2333221
Recommendations
Cites work
- A survey of selected recent results on total domination in graphs
- Efficient dominating sets in Cayley graphs.
- Efficient open domination in Cayley graphs
- Efficient total domination in digraphs
- Graph theory with applications
- scientific article; zbMATH DE number 437479 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 2230323 (Why is no real title available?)
- Independent perfect domination sets in Cayley graphs
- On bondage numbers of graphs: a survey with some comments
- On the bondage number of planar and directed graphs
- On the complexity of the bondage and reinforcement problems
- On weighted efficient total domination
- Perfect domination in regular grid graphs
- Perfect domination sets in Cayley graphs
- Some progress on total bondage in graphs
- The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
- The bondage number of a graph
- The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs
- Theory and Application of Graphs
- Total bondage number of a graph
- Total domination in graphs
Cited in
(3)
This page was built for publication: The total bondage numbers and efficient total dominations of vertex-transitive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333221)