Total and paired-domination numbers of a tree
From MaRDI portal
Publication:1773836
zbMath1066.05101MaRDI QIDQ1773836
Mustapha Chellali, Teresa W. Haynes
Publication date: 3 May 2005
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Paired domination in trees ⋮ Graphs with large paired-domination number ⋮ Global edge alliances in graphs ⋮ On the weak Roman domination number of lexicographic product graphs ⋮ Algorithmic aspects of paired disjunctive domination in graphs ⋮ Bounds on the disjunctive total domination number of a tree ⋮ Efficient open domination in Cayley graphs ⋮ Paired-domination in generalized claw-free graphs ⋮ On the \(k\)-limited packing numbers in graphs ⋮ Which trees have a differentiating-paired dominating set? ⋮ 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 ⋮ Lower bounds on the total domination number of a graph ⋮ A polynomial-time algorithm for the paired-domination problem on permutation graphs ⋮ The diameter of paired-domination vertex critical graphs ⋮ Paired Domination in Graphs ⋮ Bounds on weak and strong total domination in graphs ⋮ Further results on packing related parameters in graphs
