In a graph G, a vertex dominates itself and its neighbors. A subset D is contained in V(G) is a double dominating set of G if D dominates every vertex of G at least twice. The double domination number is the minimum cardinality among all double dominating sets of G. In this note we find lower and upper bounds for double domination numbers in terms of the diameter of G and the girth of G.
展开▼
