On the total \k\-domination number of Cartesian products of graphs
From MaRDI portal
Publication:1037451
DOI10.1007/S10878-008-9144-2zbMATH Open1193.05128OpenAlexW2073837345MaRDI QIDQ1037451FDOQ1037451
Authors: Ning Li, Xinmin Hou 
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
Recommendations
Cites Work
- Total domination in graphs
- Title not available (Why is that?)
- On the total domination number of Cartesian products of graphs
- Associative graph products and their independence, domination and coloring numbers
- Title not available (Why is that?)
- An inequality related to Vizing's conjecture
- Total domination of Cartesian products of graphs
- On integer domination in graphs and Vizing-like problems
- Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof
Cited In (22)
- On total $\{k\}$-domatic number of Cartesian and direct product of graphs
- A note on total and paired domination of Cartesian product graphs
- Total domination of Cartesian products of graphs
- Vizing's conjecture: a survey and recent results
- Relating the total \(\{2\}\)-domination number with the total domination number of graphs
- Title not available (Why is that?)
- Total domination in the Cartesian product of a graph and \(K_2\) or \(C_n\)
- The total \(\{k\}\)-domatic number of a graph
- On total domination in the Cartesian product of graphs
- Total \(k\)-domination in Cartesian product graphs
- \(k\)-tuple total domination in cross products of graphs
- Cartesian product graphs and \(k\)-tuple total domination
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs
- Total \(k\)-domination in Cartesian product of complete graphs
- Domination parameters with number 2: interrelations and algorithmic consequences
- On the \(\{k\}\)-domination number of Cartesian products of graphs
- Graph products and integer domination. II
- Complexity of Total {k}-Domination and Related Problems
- Bounds for complete cototal domination number of Cartesian product graphs and complement graphs
- Total $k$-domination in strong product graphs
- Title not available (Why is that?)
- Total \(\{k\}\)-domination in special graphs
This page was built for publication: On the total \(\{k\}\)-domination number of Cartesian products of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1037451)
