Characterization of graphs with equal domination numbers and independence numbers

摘要

The domination number γ(G) of a graph G is the minimum cardinality among all dominating sets of G, and the independence number α(G) of G is the maximum cardinality among all independent sets of G. For any graph G, it is easy to see that γ(G) ≤ α(G). Jou [6] has characterized trees with equal domination numbers and independence numbers. In this paper, we extend the result and present a characterization of connected unicyclic graphs with equal domination numbers and independence numbers.