A Note on Inequalities for Three Domination Parameters
Abstract
In this short paper, we establish relations between the domination number γ, the total domination number γt, and the connected domination number γc of a graph. In particular, we prove upper and lower bounds for γt in terms of γ and γc.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.