An upper bound on the domination number of a graph with minimum degree 2

DOI10.1016/j.disc.2007.12.080zbMath1168.05345OpenAlexW2024500249MaRDI QIDQ1011694

Allan Frendrup, Michael A. Henning, Bert Randerath, Preben Dahl Vestergaard

Publication date: 9 April 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.080

zbMATH Keywords

boundsdominating setpath-componentdomination numbervertex domination

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Domination number in graphs with minimum degree two ⋮ Unnamed Item ⋮ Failed power domination on graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Domination in graphs of minimum degree five
• Domination in graphs with minimum degree two
• Bounds related to domination in graphs with minimum degree two
• Paths, Stars and the Number Three
• Minimum independent dominating sets of random cubic graphs
• The dominating number of a random cubic graph
• On the Independent Domination Number of Random Regular Graphs