Bounds for complete cototal domination number of Cartesian product graphs and complement graphs

DOI10.1142/S1793830921500907zbMath1482.05255OpenAlexW3133385077MaRDI QIDQ5063261

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

zbMATH Keywords

Cartesian product graphscomplement graphscototal domination numbercomplete cototal dominating setcomplete cototal domination numbercototal dominating set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Domination parameters of a graph and its complement
• Total domination in graphs
• Towards a theory of domination in graphs
• The cototal domination number of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds for complete cototal domination number of Cartesian product graphs and complement graphs