Bounds for complete cototal domination number of Cartesian product graphs and complement graphs
From MaRDI portal
Publication:5063261
Recommendations
- On the total domination number of Cartesian products of graphs
- Total \(k\)-domination in Cartesian product of complete graphs
- On total domination in the Cartesian product of graphs
- On the total \(\{k\}\)-domination number of Cartesian products of graphs
- On domatic and total domatic numbers of Cartesian products of graphs
- Total domination of Cartesian products of graphs
- Total \(k\)-domination in Cartesian product graphs
- On the upper total domination number of Cartesian products of graphs
- Bounds on locating total domination number of the Cartesian product of cycles and paths
- On the \(\{k\}\)-domination number of Cartesian products of graphs
Cites work
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 2109312 (Why is no real title available?)
- scientific article; zbMATH DE number 6280453 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- Domination parameters of a graph and its complement
- The cototal domination number of a graph
- Total domination in graphs
- Towards a theory of domination in graphs
This page was built for publication: Bounds for complete cototal domination number of Cartesian product graphs and complement graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5063261)