Paired versus double domination in \(K_{1,r}\)-free graphs
From MaRDI portal
Publication:2015806
DOI10.1007/s10878-012-9547-yzbMath1297.90154OpenAlexW2031691607MaRDI QIDQ2015806
Michael A. Henning, Paul Dorbec, Bert L. Hartnell
Publication date: 24 June 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9547-y
Related Items (5)
Domination parameters with number 2: interrelations and algorithmic consequences ⋮ Total domination versus paired-domination in regular graphs ⋮ Paired Domination in Graphs ⋮ Multiple Domination ⋮ Upper paired domination versus upper domination
Cites Work
- Paired-domination in subdivided star-free graphs
- Paired-domination in claw-free cubic graphs
- Upper bounds on the paired-domination number
- \(k\)-tuple domination in graphs
- Paired-domination in \(P_{5}\)-free graphs
- Algorithmic aspect of \(k\)-tuple domination in graphs.
- Paired-domination in generalized claw-free graphs
- Characterizations of trees with equal paired and double domination numbers
- Paired-domination in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Paired versus double domination in \(K_{1,r}\)-free graphs