New bounds on the double total domination number of graphs
From MaRDI portal
Publication:2064931
DOI10.1007/S40840-021-01200-0zbMATH Open1479.05251OpenAlexW3203804620MaRDI QIDQ2064931FDOQ2064931
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Total domination in graphs
- A survey of selected recent results on total domination in graphs
- Strong transversals in hypergraphs and double total domination in graphs
- \(k\)-tuple total domination in graphs
- Total \(k\)-domination in Cartesian product graphs
- \(k\)-tuple total domination in cross products of graphs
- Title not available (Why is that?)
- Cartesian product graphs and \(k\)-tuple total domination
- Double domination in lexicographic product graphs
- Topics in Domination in Graphs
- On the total \(k\)-domination in graphs
- A note on the \(k\)-tuple total domination number of a graph
- Total $k$-domination in strong product graphs
- A note on double domination in graphs
- Multiple domination
- Structures of domination in graphs
- Domination parameters with number 2: interrelations and algorithmic consequences
- On three outer-independent domination related parameters in graphs
- Double outer-independent domination number of graphs
- Upper bounds on the \(k\)-tuple domination number and \(k\)-tuple total domination number of a graph
Cited In (10)
- Relating the total \(\{2\}\)-domination number with the total domination number of graphs
- On the double total dominator chromatic number of graphs
- Bounds on double domination numbers of graphs
- Relating the super domination and 2-domination numbers in cactus graphs
- Bounds on the double Italian domination number of a graph
- On Double Domination in Graphs
- Double total domination in the generalized lexicographic product of graphs
- On bounds for the index of double nested graphs
- The double global domination number of a graph
- Double domination in rooted product graphs
This page was built for publication: New bounds on the double total domination number of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2064931)
