Eternal m-Security Bondage Numbers in Graphs
暂无分享,去创建一个
[1] Ulrich Teschner. A counterexample to a conjecture on the bondage number of a graph , 1993, Discret. Math..
[2] Douglas F. Rall,et al. Bounds on the bondage number of a graph , 1994, Discret. Math..
[3] Michael S. Jacobson,et al. The bondage number of a graph , 1991, Discret. Math..
[4] D. West. Introduction to Graph Theory , 1995 .
[5] Ulrich Teschner. The bondage number of a graph G can be much greater than Delta(G) , 1996, Ars Comb..
[6] J. Moon,et al. Relations between packing and covering numbers of a tree , 1975 .
[7] Ulrich Teschner,et al. New results about the bondage number of a graph , 1997, Discret. Math..
[8] JH van Vuuren,et al. Infinite Order Domination in Graphs , 2003 .
[9] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.
[10] Jun-Ming Xu,et al. On Bondage Numbers of Graphs: A Survey with Some Comments , 2012, 1204.4010.
[11] Jun-Ming Xu,et al. The bondage numbers and efficient dominations of vertex-transitive graphs , 2008, Discret. Math..
[12] Yue-Li Wang,et al. On the bondage number of a graph , 1996, Discret. Math..