Upper bounds for the paired-domination numbers of graphs

DOI10.1007/s00373-015-1661-zzbMath1342.05102OpenAlexW2182406749MaRDI QIDQ2631089

Kan Wang, Chao Wang, Chang-hong Lu

Publication date: 28 July 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-015-1661-z

zbMATH Keywords

regular graphdominating setpaired-domination

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Cubic graphs have paired-domination number at most four-seventh of their orders ⋮ Paired Domination in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Paired-domination in claw-free cubic graphs
• Upper paired-domination in claw-free graphs
• Graphs with large paired-domination number
• A characterization of cubic graphs with paired-domination number three-fifths their order
• Labelling algorithms for paired-domination problems in block and interval graphs
• Paired-domination in claw-free graphs with minimum degree at least three
• Paired-domination in claw-free graphs
• Paired-domination in graphs