A characterization of cubic graphs with paired-domination number three-fifths their order

DOI10.1007/S00373-010-0884-2MaRDI QIDQ968213zbMATH OpenOpenAlexFDO

Authors Wayne Goddard, Michael A. Henning

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

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Cubic graphs have paired-domination number at most four-seventh of their orders
• Paired-domination in claw-free cubic graphs
• scientific article; zbMATH DE number 6837042
• Graphs with large paired-domination number
• Disjoint paired-dominating sets in cubic graphs

Cites work

• scientific article; zbMATH DE number 1185309 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 5221647 (Why is no real title available?)
• Graphs with large paired-domination number
• Paired domination on interval and circular-arc graphs
• Paired-domination in claw-free cubic graphs
• Paired-domination in generalized claw-free graphs
• Paired-domination in graphs

Cited in

(17)

• Cubic graphs have paired-domination number at most four-seventh of their orders
• Upper bounds for the paired-domination numbers of graphs
• Paired-domination in claw-free graphs with minimum degree at least three
• My favorite domination conjectures in graph theory are bounded
• scientific article; zbMATH DE number 1998304 (Why is no real title available?)
• Paired-domination number of claw-free odd-regular graphs
• A characterization of graphs with disjoint dominating and paired-dominating sets
• Best possible upper bounds on the restrained domination number of cubic graphs
• Graphs with maximum size and given paired-domination number
• Total domination versus paired-domination in regular graphs
• Upper paired domination versus upper domination
• An upper bound on the paired-domination number in terms of the number of edges in the graph
• Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph
• Bounds on the paired domination number of graphs with minimum degree at least three
• Paired domination in graphs
• Paired-domination in claw-free graphs
• Bounds on domination parameters in graphs: a brief survey

This page was built for publication: A characterization of cubic graphs with paired-domination number three-fifths their order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968213)