On the total \(\{k\}\)-domination number of Cartesian products of graphs

DOI10.1007/s10878-008-9144-2zbMath1193.05128MaRDI QIDQ1037451

Xin Min Hou, Ning Li

Publication date: 16 November 2009

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-008-9144-2

zbMATH Keywords

Cartesian product; total domination; total \(\{k\}\)-domination

Mathematics Subject Classification ID

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Related Items

Total \(k\)-domination in Cartesian product of complete graphs, The total \(\{k\}\)-domatic number of a graph, Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs, Domination parameters with number 2: interrelations and algorithmic consequences, Total \(k\)-domination in Cartesian product graphs, Total $k$-domination in strong product graphs, Total \(\{k\}\)-domination in special graphs, Relating the total \(\{2\}\)-domination number with the total domination number of graphs, Complexity of Total {k}-Domination and Related Problems, Vizing's conjecture: a survey and recent results

Cites Work

• On integer domination in graphs and Vizing-like problems
• An inequality related to Vizing's conjecture
• On the total domination number of Cartesian products of graphs
• Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof
• Associative graph products and their independence, domination and coloring numbers
• Total domination in graphs
• Total domination of Cartesian products of graphs
• Unnamed Item
• Unnamed Item