Domination and total domination in cubic graphs of large girth
From MaRDI portal
Publication:400535
DOI10.1016/j.dam.2014.04.011zbMath1298.05247OpenAlexW2044910386MaRDI QIDQ400535
Felix Joos, Deiwison S. Machado, Dieter Rautenbach, Simone Dantas, Christian Löwenstein
Publication date: 22 August 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.04.011
Related Items
Domination number of graphs with minimum degree five ⋮ Perfectly relating the domination, total domination, and paired domination numbers of a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of selected recent results on total domination in graphs
- Total domination in graphs with given girth
- Girth and total domination in graphs
- Construction of trees and graphs with equal domination parameters
- Domination in graphs of minimum degree at least two and large girth
- Domination number of cubic graphs with large girth
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Domination in Cubic Graphs of Large Girth