Nordhaus-Gaddum bounds for upper total domination
A set \(S\) of vertices in an isolate-free graph \(G\) is a total dominating set if every vertex in \(G\) is adjacent to a vertex in \(S\). A total dominating set of \(G\) is minimal if it contains no total dominating set of \(G\) as a proper subset. The upper total domination number \(\Gamma_t(G)\)...
Main Authors: | Teresa W. Haynes, Michael A. Henning |
---|---|
Format: | Article |
Language: | English |
Published: |
AGH Univeristy of Science and Technology Press
2022-06-01
|
Series: | Opuscula Mathematica |
Subjects: | |
Online Access: | https://www.opuscula.agh.edu.pl/vol42/4/art/opuscula_math_4226.pdf |
Similar Items
-
An Improved Nordhaus–Gaddum-Type Theorem for 2-Rainbow Independent Domination Number
by: Enqiang Zhu
Published: (2021-02-01) -
Products of graphs and Nordhaus-Gaddum type inequalities for eigenvalues
by: Nastaran Keyvan, et al.
Published: (2018-03-01) -
图的Nordhaus-Ghaddumm型的代数连通度的界(A sharp lower bound for the algebraic connectivity of the Nordhaus- Gaddumm type)
by: LÜDa-mei,(吕大梅), et al.
Published: (2009-11-01) -
Bounds on weak and strong total domination in graphs
by: M.H. Akhbari, et al.
Published: (2016-04-01) -
On Nordhaus-Gaddum type relations of δ-complement graphs
by: Panupong Vichitkunakorn, et al.
Published: (2023-06-01)