For connected isolate-free graphs, the paper proves several upper and lower bounds on the total domination number in terms of the domination and connected domination numbers, and conjectures a sharper lower bound.
CRC press, 2013
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Note on Inequalities for Three Domination Parameters
For connected isolate-free graphs, the paper proves several upper and lower bounds on the total domination number in terms of the domination and connected domination numbers, and conjectures a sharper lower bound.