Total $k$-domination in strong product graphs
From MaRDI portal
Publication:2420408
DOI10.1016/j.dam.2018.03.043zbMath1414.05217OpenAlexW2801247117MaRDI QIDQ2420408
José María Sigarreta-Almira, Sergio Bermudo, Juan C. Hernández-Gómez
Publication date: 6 June 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.043
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items (3)
Total \(k\)-domination in Cartesian product of complete graphs ⋮ Algorithm and hardness results on neighborhood total domination in graphs ⋮ New bounds on the double total domination number of graphs
Cites Work
- Coloring, location and domination of corona graphs
- \(k\)-tuple total domination in graphs
- On the total domination number of cross products of graphs
- On the total \(\{k\}\)-domination number of Cartesian products of graphs
- On graphs having domination number half their order
- Total domination number of grid graphs
- On the total \(k\)-domination in graphs
- Total \(k\)-domination in Cartesian product graphs
- \(k\)-tuple total domination in cross products of graphs
- Toughness of the corona of two graphs
- An upper bound for thek-domination number of a graph
- Enclaveless sets and MK-Systems
- Total domination in graphs
- Total Domination in Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Total $k$-domination in strong product graphs