Characterizations of trees with equal paired and double domination numbers

DOI10.1016/j.disc.2006.03.061zbMath1100.05068OpenAlexW2005596171MaRDI QIDQ2501557

Teresa W. Haynes, Mostafa Blidia, Mustapha Chellali

Publication date: 14 September 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.03.061

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs ⋮ On construction for trees making the equality hold in Vizing's conjecture ⋮ On the domination of triangulated discs ⋮ Total domination versus paired-domination in regular graphs ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Ratios of some domination parameters in trees ⋮ Complexity of distance paired-domination problem in graphs ⋮ Paired versus double domination in \(K_{1,r}\)-free graphs ⋮ Some matching properties in \(4-\gamma_{\times 2}\)-critical graphs ⋮ The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs ⋮ On the double bondage number of graphs products ⋮ A polynomial-time algorithm for the paired-domination problem on permutation graphs ⋮ Paired Domination in Graphs ⋮ Multiple Domination ⋮ Bipartite graphs with close domination and \(k\)-domination numbers ⋮ Constructive characterizations of \( (\gamma_p,\gamma)\)-and \( (\gamma_p, \gamma_{pr})\)-trees ⋮ Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs

Cites Work

• Paired-domination in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item