Total \(k\)-domination in Cartesian product of complete graphs
From MaRDI portal
Publication:6162024
DOI10.1016/j.dam.2023.04.008zbMath1516.05161arXiv2001.07850MaRDI QIDQ6162024
Justin Wisby, Walter Carballosa
Publication date: 15 June 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.07850
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- A survey of selected recent results on total domination in graphs
- On the total \(\{k\}\)-domination number of Cartesian products of graphs
- On total domination in the Cartesian product of graphs
- Total \(k\)-domination in Cartesian product graphs
- On the total domination number of Cartesian products of graphs
- Bounds on neighborhood total domination number in graphs
- Total $k$-domination in strong product graphs
- Total Roman domination in the lexicographic product of graphs
- On \(k\)-domination and \(j\)-independence in graphs
- Total domination in graphs
- Chromatic total domination in graphs
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
This page was built for publication: Total \(k\)-domination in Cartesian product of complete graphs
