Characterizations of trees with equal paired and double domination numbers
From MaRDI portal
Publication:2501557
DOI10.1016/j.disc.2006.03.061zbMath1100.05068MaRDI 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
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs, \(k\)-domination and \(k\)-independence in graphs: A survey, Ratios of some domination parameters in trees, Some matching properties in \(4-\gamma_{\times 2}\)-critical graphs, The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs, A polynomial-time algorithm for the paired-domination problem on permutation graphs, Constructive characterizations of \( (\gamma_p,\gamma)\)-and \( (\gamma_p, \gamma_{pr})\)-trees, Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs, Total domination versus paired-domination in regular graphs, Complexity of distance paired-domination problem in graphs, Paired versus double domination in \(K_{1,r}\)-free graphs
Cites Work
