A Note on Inequalities for Three Domination Parameters

2025/06/04 by Dickson Y. B. Annor, Annor, Dickson Y. B.
Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #Interconnection Networks and Systems

paper · pdf · doi:10.48550/arxiv.2506.03646

openalex publication_date 2025/06/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• A Note on Connected Dominating Set in Graphs Without Long Paths And Cycles
• Lower bounds for the total (distance) k-domination number of a graph
• Disjunctive Total Domination in Graphs
• Graphs with Large Disjunctive Total Domination Number
• A note on sub-total domination in graphs