Independence and k-domination in graphs
暂无分享,去创建一个
[1] Yair Caro,et al. A note on the k-domination number of a graph , 1990 .
[2] Michael S. Jacobson,et al. On n-domination, n-dependence and forbidden subgraphs , 1985 .
[3] Odile Favaron,et al. On k‐domination and minimum degree in graphs , 2008, J. Graph Theory.
[4] R. L. Brooks. On colouring the nodes of a network , 1941, Mathematical Proceedings of the Cambridge Philosophical Society.
[5] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.
[6] Jun Fujisawa,et al. Independence and 2-domination in bipartite graphs , 2008 .
[7] Lutz Volkmann,et al. Some bounds on the p-domination number in trees , 2006, Discret. Math..
[8] S. Hedetniemi,et al. Domination in graphs : advanced topics , 1998 .
[9] F. Bruce Shepherd,et al. An upper bound for the k-domination number of a graph , 1985, J. Graph Theory.
[10] Lutz Volkmann. Graphen an allen Ecken und Kanten , 2011 .
[11] Odile Favaron,et al. Independence and 2-domination in trees , 2005, Australas. J Comb..