Discussiones Mathematicae Graph Theory 25(1-2) (2005)
29-34
doi: 10.7151/dmgt.1256
Jochen Harant
Department of Mathematics |
Michael A. Henning
School of Mathematics, Statistics, & |
Keywords: average degree, bounds, double domination, probabilistic method.
2000 Mathematics Subject Classification: 05C69.
[1] | M. Blidia, M. Chellali and T.W. Haynes, Characterizations of trees with equal paired and double domination numbers, submitted for publication. |
[2] | M. Blidia, M. Chellali, T.W. Haynes and M.A. Henning, Independent and double domination in trees, submitted for publication. |
[3] | M. Chellali and T.W. Haynes, Paired and double domination in graphs, Utilitas Math., to appear. |
[4] | J. Harant, A. Pruchnewski and M. Voigt, On dominating sets and independent sets of graphs, Combin. Prob. and Comput. 8 (1998) 547-553, doi: 10.1017/S0963548399004034. |
[5] | F. Harary and T.W. Haynes, Double domination in graphs, Ars Combin. 55 (2000) 201-213. |
[6] | T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs (Marcel Dekker, New York, 1998). |
[7] | T.W. Haynes, S.T. Hedetniemi and P.J. Slater (eds), Domination in Graphs: Advanced Topics (Marcel Dekker, New York, 1998). |
[8] | M.A. Henning, Graphs with large double domination numbers, submitted for publication. |
[9] | C.S. Liao and G.J. Chang, Algorithmic aspects of k-tuple domination in graphs, Taiwanese J. Math. 6 (2002) 415-420. |
[10] | C.S. Liao and G.J. Chang, k-tuple domination in graphs, Information Processing Letters 87 (2003) 45-50, doi: 10.1016/S0020-0190(03)00233-3. |
Received 22 October 2003
Revised 6 May 2004