On the total \(k\)-domination in graphs
From MaRDI portal
Publication:1692651
DOI10.7151/dmgt.2016zbMath1377.05137OpenAlexW2766096102MaRDI QIDQ1692651
Sergio Bermudo, Juan C. Hernández-Gómez, José María Sigarreta-Almira
Publication date: 10 January 2018
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2016
Related Items (11)
On the global total $k$-domination number of graphs ⋮ Total $k$-domination in strong product graphs ⋮ \(k\)-domination and total \(k\)-domination numbers in catacondensed hexagonal systems ⋮ Algorithm and hardness results on neighborhood total domination in graphs ⋮ Total \(k\)-domination in Cartesian product graphs ⋮ Relating the total \(\{2\}\)-domination number with the total domination number of graphs ⋮ On \(f\)-domination: polyhedral and algorithmic results ⋮ Multiple Domination ⋮ Unnamed Item ⋮ On disjunctive domination in graphs ⋮ New bounds on the double total domination number of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of selected recent results on total domination in graphs
- Total \(k\)-domination in Cartesian product graphs
- \(k\)-tuple total domination in cross products of graphs
- On the total k-domination number of graphs
- Total Domination in Graphs
- K-tuple total domination in inflated graphs
- On Double Domination in Graphs
- Some results on total domination in direct products of graphs
- On domination and annihilation in graphs with claw-free blocks
This page was built for publication: On the total \(k\)-domination in graphs