Bounds for complete cototal domination number of Cartesian product graphs and complement graphs
DOI10.1142/S1793830921500907zbMATH Open1482.05255OpenAlexW3133385077MaRDI QIDQ5063261FDOQ5063261
Authors: J. Maria Regila Baby, K. Uma Samundesvari 
Publication date: 17 March 2022
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830921500907
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
Cartesian product graphscomplement graphscototal domination numbercomplete cototal dominating setcomplete cototal domination numbercototal dominating set
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Title not available (Why is that?)
- Total domination in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Towards a theory of domination in graphs
- The cototal domination number of a graph
- Title not available (Why is that?)
- Domination parameters of a graph and its complement
- Title not available (Why is that?)
Cited In (1)
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)
