| Some New Results on Double Domination in Graphs |
| Received:April 15, 2002 |
| Key Words:
double domination number claw-free graph connected domination number
|
| Fund Project:the National Natural Science Foundation of China (19871036) |
|
| Hits: 2960 |
| Download times: 1663 |
| Abstract: |
| Each vertex of a graph G = (V, E) is said to dominate every vertex in its closed neighborhood. A set S?V is a double dominating set for G if each vertex in V is dominated by at least two vertices in S. The smallest cardinality of a double dominating set is called the double dominating number dd(G). In this paper, new relationships between dd(G) and other domination parameters are explored and some results of [1] are extended. Furthermore, we give the Nordhaus-Gaddum-type results for double dominating number. |
| Citation: |
| DOI:10.3770/j.issn:1000-341X.2005.03.011 |
| View Full Text View/Add Comment |
