On the domination number of graphs with minimum degree six

Csilla Bujtás, Michael A. Henning

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


A dominating set in a graph G is a set S of vertices such that every vertex that does not belong to S is adjacent to a vertex from it. The domination number γ(G) is the minimum cardinality of a dominating set in G. In this paper we prove that if G is a graph of order n with minimum degree at least 6, then [Formula presented]. This improves the best known bounds to date.

Original languageEnglish
Article number112449
JournalDiscrete Mathematics
Issue number8
Publication statusPublished - Aug 2021


  • Domination in graphs
  • Minimum degree six
  • Upper bounds

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'On the domination number of graphs with minimum degree six'. Together they form a unique fingerprint.

Cite this