论文信息 - Upper bounds on the k-domination number and the k-Roman domination number - 字舞流文

Upper bounds on the k-domination number and the k-Roman domination number

Lutz Volkmann | Adriana Hansberg | L. Volkmann | A. Hansberg

[1] F. Bruce Shepherd,et al. An upper bound for the k-domination number of a graph , 1985, J. Graph Theory.

[2] M. Jacobson,et al. n-Domination in graphs , 1985 .

[3] D. R. Lick,et al. Graph theory with applications to algorithms and computer science , 1985 .

[4] Michael S. Jacobson,et al. On n-domination, n-dependence and forbidden subgraphs , 1985 .

[5] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[6] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[7] S. Hedetniemi,et al. Domination in graphs : advanced topics , 1998 .

[8] I. Stewart. Defend the Roman Empire , 1999 .

[9] Charles S. Revelle,et al. Defendens Imperium Romanum: A Classical Problem in Military Strategy , 2000, Am. Math. Mon..

[10] Raphael Yuster,et al. Dominating A Family Of Graphs With Small Connected Subgraphs , 2000, Comb. Probab. Comput..

[11] N. Alon,et al. Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2004 .

[12] Stephen T. Hedetniemi,et al. Roman domination in graphs , 2004, Discret. Math..

[13] Dieter Rautenbach,et al. New bounds on the k-domination number and the k-tuple domination number , 2007, Appl. Math. Lett..