New bounds on the double total domination number of graphs
From MaRDI portal
Publication:2064931
DOI10.1007/s40840-021-01200-0zbMath1479.05251OpenAlexW3203804620MaRDI QIDQ2064931
F. A. Hernández-Mira, Abel Cabrera Martínez
Publication date: 6 January 2022
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-021-01200-0
Related Items (3)
Relating the super domination and 2-domination numbers in cactus graphs ⋮ Double domination in rooted product graphs ⋮ Relating the total \(\{2\}\)-domination number with the total domination number of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(k\)-tuple total domination in graphs
- Double domination in lexicographic product graphs
- A survey of selected recent results on total domination in graphs
- Domination parameters with number 2: interrelations and algorithmic consequences
- On the total \(k\)-domination in graphs
- Total \(k\)-domination in Cartesian product graphs
- \(k\)-tuple total domination in cross products of graphs
- A note on double domination in graphs
- Total $k$-domination in strong product graphs
- On three outer-independent domination related parameters in graphs
- Strong Transversals in Hypergraphs and Double Total Domination in Graphs
- Multiple Domination
- Total Domination in Graphs
- Double outer-independent domination number of graphs
- Cartesian product graphs and k-tuple total domination
- Structures of Domination in Graphs
- Topics in Domination in Graphs
- A note on the \(k\)-tuple total domination number of a graph
This page was built for publication: New bounds on the double total domination number of graphs
