A characterization of cubic graphs with paired-domination number three-fifths their order
From MaRDI portal
Publication:968213
DOI10.1007/s00373-010-0884-2zbMath1203.05117OpenAlexW2094189251MaRDI QIDQ968213
Michael A. Henning, Wayne Goddard
Publication date: 5 May 2010
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-010-0884-2
Related Items
Upper bounds for the paired-domination numbers of graphs ⋮ Paired-domination in claw-free graphs ⋮ Bounds on domination parameters in graphs: a brief survey ⋮ Cubic graphs have paired-domination number at most four-seventh of their orders ⋮ Total domination versus paired-domination in regular graphs ⋮ Graphs with maximum size and given paired-domination number ⋮ Paired-domination in claw-free graphs with minimum degree at least three ⋮ Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph ⋮ Paired-domination number of claw-free odd-regular graphs ⋮ An upper bound on the paired-domination number in terms of the number of edges in the graph ⋮ A characterization of graphs with disjoint dominating and paired-dominating sets ⋮ Paired Domination in Graphs ⋮ Bounds on the paired domination number of graphs with minimum degree at least three ⋮ My Favorite Domination Conjectures in Graph Theory Are Bounded ⋮ Upper paired domination versus upper domination
Cites Work
