Total \k\-domination in special graphs
From MaRDI portal
Publication:2668541
Recommendations
Cites work
- A short proof of a result on a Vizing-like problem for integer total domination
- Complexity of Total {k}-Domination and Related Problems
- 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 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 867701 (Why is no real title available?)
- On the total \(\{ k\} \)-domination and total \(\{ k\} \)-domatic number of graphs
- On the total \(\{k\}\)-domination number of Cartesian products of graphs
- Vizing's conjecture: a survey and recent results
Cited in
(8)- On the total \(k\)-domination in graphs
- The total \(\{k\}\)-domatic number of wheels and complete graphs
- On the total \(\{ k\} \)-domination and total \(\{ k\} \)-domatic number of graphs
- A note on graphs with largest total k-domination number.
- The total \(\{k\}\)-domatic number of a graph
- Total domination value in graphs
- On k-Total Dominating Graphs
- The integer \(\{k\}\)-domination number of circulant graphs
This page was built for publication: Total \(\{k\}\)-domination in special graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2668541)