Publication:5461697
From MaRDI portal
zbMath1069.05058MaRDI QIDQ5461697
Teresa W. Haynes, Mustapha Chellali
Publication date: 26 July 2005
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
On the packing numbers in graphs, Which trees have a differentiating-paired dominating set?, \(k\)-domination and \(k\)-independence in graphs: A survey, An upper bound on the paired-domination number in terms of the number of edges in the graph, Upper paired-domination in claw-free graphs, Double domination in lexicographic product graphs, Graphs with large paired-domination number, Some matching properties in \(4-\gamma_{\times 2}\)-critical graphs, Vertices contained in all or in no minimum paired-dominating set of a tree, Paired versus double domination in \(K_{1,r}\)-free graphs, Paired-domination in generalized claw-free graphs, Characterizations of trees with equal paired and double domination numbers, The diameter of paired-domination vertex critical graphs