A new upper bound on the total domination number in graphs with minimum degree six

Michael A. Henning*, Anders Yeo

*Kontaktforfatter for dette arbejde

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

Abstrakt

A total dominating set in a graph G is a set of vertices of G such that every vertex is adjacent to a vertex of the set. The total domination number γt(G) is the minimum cardinality of a dominating set in G. Thomassé and Yeo (2007) conjectured that if G is a graph on n vertices with minimum degree at least 5, then [Formula presented]. In this paper, it is shown that the Thomassé–Yeo conjecture holds with strict inequality if the minimum degree at least 6. More precisely, it is proven that if G is a graph of order n with δ(G)≥6, then [Formula presented]. This improves the best known upper bounds to date on the total domination number of a graph with minimum degree at least 6.

OriginalsprogEngelsk
TidsskriftDiscrete Applied mathematics
Vol/bind302
Sider (fra-til)1-7
ISSN0166-218X
DOI
StatusUdgivet - 30. okt. 2021

Bibliografisk note

Funding Information:
Research supported in part by the University of Johannesburg, South Africa.Research of the second author supported by the Danish research council under grant number DFF-7014-00037B.

Publisher Copyright:
© 2021 Elsevier B.V.

Fingeraftryk

Dyk ned i forskningsemnerne om 'A new upper bound on the total domination number in graphs with minimum degree six'. Sammen danner de et unikt fingeraftryk.

Citationsformater