On the domination number of graphs with minimum degree six

DOI10.1016/j.disc.2021.112449zbMath1466.05159OpenAlexW3162039944MaRDI QIDQ2032873

Michael A. Henning, Csilla Bujtás

Publication date: 14 June 2021

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

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

zbMATH Keywords

upper boundsdomination in graphsminimum degree six

Mathematics Subject Classification ID

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

Related Items (1)

Bounds on domination parameters in graphs: a brief survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved upper bounds on the domination number of graphs with minimum degree at least five
• Domination number of graphs with minimum degree five
• Domination in graphs with minimum degree two
• DOMINATION IN GRAPHS OF MINIMUM DEGREE FOUR
• Domination-balanced graphs
• Paths, Stars and the Number Three
• Total Domination in Graphs

This page was built for publication: On the domination number of graphs with minimum degree six