On the complexity of the bondage and reinforcement problems
暂无分享,去创建一个
[1] S. Hedetniemi,et al. Domination in graphs : advanced topics , 1998 .
[2] N. Sridharan,et al. Total Reinforcement Number of a Graph , 2020 .
[3] S. M. Hedetniemi,et al. On the Algorithmic Complexity of Total Domination , 1984 .
[4] Yue-Li Wang,et al. On the bondage number of a graph , 1996, Discret. Math..
[5] Junming Xu,et al. Theory and Application of Graphs , 2003, Network Theory and Applications.
[6] Michael A. Henning,et al. A note on total reinforcement in graphs , 2011, Discret. Appl. Math..
[7] N. Sridharan. Total Bondage Number of a Graph , 2007 .
[8] Jan Arne Telle,et al. Algorithms for Vertex Partitioning Problems on Partial k-Trees , 1997, SIAM J. Discret. Math..
[9] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.
[10] Johannes H. Hattingh,et al. Restrained domination in graphs , 1999, Discret. Math..
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[12] Ermelinda DeLaViña,et al. On Total Domination in Graphs , 2012 .
[13] Jun-Ming Xu,et al. Reinforcement numbers of digraphs , 2009, Discret. Appl. Math..
[14] Johannes H. Hattingh,et al. Restrained bondage in graphs , 2008, Discret. Math..
[15] Leif K. Jørgensen,et al. Edge stability of the k-domination number of trees , 1998 .
[16] Michael A. Henning,et al. A survey of selected recent results on total domination in graphs , 2009, Discret. Math..
[17] Jun-Ming Xu,et al. The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs , 2007, Comput. Math. Appl..