On the domination number of graphs with minimum degree six

Csilla Bujtás; Michael A. Henning

doi:10.1016/j.disc.2021.112449

On the domination number of graphs with minimum degree six

Csilla Bujtás, Michael A. Henning

Mathematics and Applied Mathematics

University of Ljubljana

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

Abstract

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 language	English
Article number	112449
Journal	Discrete Mathematics
Volume	344
Issue number	8
DOIs	https://doi.org/10.1016/j.disc.2021.112449
Publication status	Published - Aug 2021

Keywords

Domination in graphs
Minimum degree six
Upper bounds

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2021.112449

Cite this

@article{ab86c23b58264d9b921eafa7984444de,

title = "On the domination number of graphs with minimum degree six",

abstract = "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.",

keywords = "Domination in graphs, Minimum degree six, Upper bounds",

author = "Csilla Bujt{\'a}s and Henning, {Michael A.}",

note = "Publisher Copyright: {\textcopyright} 2021 Elsevier B.V.",

year = "2021",

month = aug,

doi = "10.1016/j.disc.2021.112449",

language = "English",

volume = "344",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "8",

}

TY - JOUR

T1 - On the domination number of graphs with minimum degree six

AU - Bujtás, Csilla

AU - Henning, Michael A.

PY - 2021/8

Y1 - 2021/8

N2 - 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.

AB - 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.

KW - Domination in graphs

KW - Minimum degree six

KW - Upper bounds

UR - http://www.scopus.com/inward/record.url?scp=85105300390&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2021.112449

DO - 10.1016/j.disc.2021.112449

M3 - Article

AN - SCOPUS:85105300390

SN - 0012-365X

VL - 344

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 8

M1 - 112449

ER -

On the domination number of graphs with minimum degree six

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this