On Bondage Numbers of Graphs: A Survey with Some Comments
暂无分享,去创建一个
[1] Jun-Ming Xu,et al. The p-Bondage Number of Trees , 2011, Graphs Comb..
[2] Xindong Zhang,et al. The bondage number in complete t-partite digraphs , 2009, Inf. Process. Lett..
[3] Frank Harary,et al. Domination alteration sets in graphs , 1983, Discret. Math..
[4] David P. Sumner,et al. Domination critical graphs , 1983, J. Comb. Theory, Ser. B.
[5] J. Moon,et al. Relations between packing and covering numbers of a tree , 1975 .
[6] Ulrich Teschner. A counterexample to a conjecture on the bondage number of a graph , 1993, Discret. Math..
[7] Zhang Jing. Independence Bondage Number and Reinforcement Number of Some Graphs , 2003 .
[8] Junming Xu,et al. Theory and Application of Graphs , 2003, Network Theory and Applications.
[9] Johannes H. Hattingh,et al. Restrained domination in graphs , 1999, Discret. Math..
[10] Stephen T. Hedetniemi,et al. Bibliography on domination in graphs and some basic definitions of domination parameters , 1991, Discret. Math..
[11] Michael A. Henning,et al. Graphs with large total domination number , 2000, J. Graph Theory.
[12] Quentin F. Stout,et al. PERFECT DOMINATING SETS , 1990 .
[13] Lutz Volkmann,et al. on Graphs with Equal Domination and Covering Numbers , 1994, Discret. Appl. Math..
[14] Jun-Ming Xu,et al. The bondage numbers of graphs with small crossing numbers , 2007, Discret. Math..
[15] Mike Develin,et al. On the bondage number of planar and directed graphs , 2006, Discret. Math..
[16] Andrei V. Gagarin,et al. Upper bounds for the bondage number of graphs on topological surfaces , 2013, Discret. Math..
[17] Xinmin Hou. A characterization of (2, p )-trees , 2008 .
[18] Lutz Volkmann,et al. A remark on the (2, 2)-domination number , 2008, Discuss. Math. Graph Theory.
[19] Johannes H. Hattingh,et al. Restrained domination in trees , 2000, Discret. Math..
[20] Liang Sun,et al. On total restrained domination in graphs , 2005 .
[21] Jun-Ming Xu,et al. Average distances and distance domination numbers , 2009, Discret. Appl. Math..
[22] Stephen T. Hedetniemi,et al. Total domination in graphs , 1980, Networks.
[23] Jun-Ming Xu,et al. Note on Conjectures of Bondage Numbers of Planar Graphs , 2012 .
[24] Renu C. Laskar,et al. The bondage and reinforcement numbers of gammaf for some graphs , 1997, Discret. Math..
[25] S. M. Hedetniemi,et al. On the Algorithmic Complexity of Total Domination , 1984 .
[26] Junming Xu. Topological Structure and Analysis of Interconnection Networks , 2002, Network Theory and Applications.
[27] Ulrich Teschner,et al. New results about the bondage number of a graph , 1997, Discret. Math..
[28] Douglas F. Rall,et al. A bound on the size of a graph with given order and bondage number , 1999, Discret. Math..
[30] Saieed Akbari,et al. A Note on the Roman Bondage Number of Planar Graphs , 2013, Graphs Comb..
[31] Vladimir Samodivkin. The bondage number of graphs: good and bad vertices , 2008, Discuss. Math. Graph Theory.
[32] Ronald D. Dutton,et al. Vertex domination-critical graphs , 1988, Networks.
[33] Jun-Ming Xu,et al. The Bondage Number of Graphs with Crossing Number Less than Four , 2013, Ars Comb..
[34] Johannes H. Hattingh,et al. Restrained bondage in graphs , 2008, Discret. Math..
[35] Lane H. Clark,et al. Efficient domination of the orientations of a graph , 1998, Discret. Math..
[36] Joseph G. Peters,et al. Efficient domination in circulant graphs with two chord lengths , 2007, Inf. Process. Lett..
[37] Jun-Ming Xu,et al. The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs , 2007, Comput. Math. Appl..
[38] Xinmin Hou. A characterization of (2gamma, gammap)-trees , 2008, Discret. Math..
[39] O. Ore. Theory of Graphs , 1962 .
[40] Erfang Shan,et al. Bondage number in oriented graphs , 2007, Ars Comb..
[42] I. Stewart. Defend the Roman Empire , 1999 .
[43] Jun-Ming Xu,et al. Complexity of Bondage and Reinforcement , 2011, ArXiv.
[44] Dieter Rautenbach,et al. Remarks on the bondage number of planar graphs , 2003, Discret. Math..
[45] Nader Jafari Rad,et al. Some Progress on Total Bondage in Graphs , 2014, Graphs Comb..
[46] Jianfeng Hou,et al. A Bound on the bondage Number of toroidal Graphs , 2012, Discret. Math. Algorithms Appl..
[47] S. Louis Hakimi,et al. On Computing a Conditional Edge-Connectivity of a Graph , 1988, Inf. Process. Lett..
[49] Jaeun Lee,et al. Independent perfect domination sets in Cayley graphs , 2001, J. Graph Theory.
[50] Ulrich Teschner,et al. A new upper bound for the bondage number of graphs with small domination number , 1995, Australas. J Comb..
[51] Kenneth Eugene Proffitt. Paired-Domination in Grid Graphs. , 2001 .
[52] Andrei V. Gagarin,et al. The bondage number of graphs on topological surfaces and Teschner's conjecture , 2013, Discret. Math..
[53] Tian Fang. Bounds for Distance Domination Numbers of Graphs , 2004 .
[54] Norbert Seifter,et al. Dominating Cartesian Products of Cycles , 1995, Discret. Appl. Math..
[55] Douglas F. Rall,et al. On dominating the Cartesian product of a graph and K2 , 2004, Discuss. Math. Graph Theory.
[56] Gary MacGillivray,et al. Efficient domination in circulant graphs , 2013, Discret. Math..
[57] Ulrich Teschner. On the bondage number of block graphs , 1997, Ars Comb..
[58] N. Sridharan. Total Bondage Number of a Graph , 2007 .
[59] Note on the bondage number of graphs on topological surfaces , 2013, Australas. J Comb..
[60] Lutz Volkmann,et al. Total restrained bondage in graphs , 2013 .
[61] Joanna Raczek. Paired bondage in trees , 2008, Discret. Math..
[62] Jun-Ming Xu,et al. On the (2, 2)-domination number of trees , 2010, Discuss. Math. Graph Theory.
[63] Joanna Cyman,et al. On the total restrained domination number of a graph , 2006, Australas. J Comb..
[64] Ermelinda DeLaViña,et al. On Total Domination in Graphs , 2012 .
[65] Junming Xu,et al. The 2-Domination and 2-Bondage Numbers of Grid Graphs ∗ , 2012, 1204.4514.
[66] Jan Arne Telle,et al. Algorithms for Vertex Partitioning Problems on Partial k-Trees , 1997, SIAM J. Discret. Math..
[67] Douglas F. Rall,et al. Bounds on the bondage number of a graph , 1994, Discret. Math..
[68] J. Topp,et al. k- and k-stable graphs , 2000 .
[69] Ding-Zhu Du,et al. Paired-domination of Trees , 2003, J. Glob. Optim..
[70] Johannes H. Hattingh,et al. An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree , 2009, Discret. Appl. Math..
[71] Leif K. Jørgensen,et al. Edge stability of the k-domination number of trees , 1998 .
[72] Lutz Volkmann,et al. On the Roman Bondage Number of Planar Graphs , 2011, Graphs Comb..
[73] M. Jacobson,et al. n-Domination in graphs , 1985 .
[74] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.
[75] Jun-Ming Xu,et al. The bondage numbers and efficient dominations of vertex-transitive graphs , 2008, Discret. Math..
[76] S. Hedetniemi,et al. Domination in graphs : advanced topics , 1998 .
[77] Michael A. Henning,et al. On the integrity of distance domination in graphs , 1994, Australas. J Comb..
[78] Jun-Ming Xu,et al. On the complexity of the bondage and reinforcement problems , 2012, J. Complex..
[79] Seyed Mahmoud Sheikholeslami,et al. On the Roman bondage Number of a Graph , 2011, Discret. Math. Algorithms Appl..
[81] Michael S. Jacobson,et al. The bondage number of a graph , 1991, Discret. Math..
[82] William J. Cook,et al. The discipline number of a graph , 1991, Discret. Math..
[83] Yukio Shibata,et al. Extension of de Bruijn graph and Kautz graph , 1995 .
[84] Lutz Volkmann,et al. Roman bondage in graphs , 2011, Discuss. Math. Graph Theory.
[85] Yue-Li Wang,et al. On the bondage number of a graph , 1996, Discret. Math..
[86] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[87] Laura A. Sanchis. Maximum number of edges in connected graphs with a given domination number , 1991, Discret. Math..
[88] Michael A. Henning,et al. A survey of selected recent results on total domination in graphs , 2009, Discret. Math..
[89] Jianxiang Cao,et al. Research on the Total Bondage Number of a Spectial Network , 2010, 2010 Third International Joint Conference on Computational Science and Optimization.
[90] Peter J. Slater,et al. Paired-domination in graphs , 1998, Networks.
[91] Seyed Mahmoud Sheikholeslami,et al. The k-rainbow bondage number of a graph , 2014, Discret. Appl. Math..
[92] Martin Farber,et al. Steiner trees, connected domination and strongly chordal graphs , 1985, Networks.
[93] Jun-Ming Xu,et al. A note on distance domination numbers of graphs , 2009, Australas. J Comb..
[94] Martin Farber,et al. Domination, independent domination, and duality in strongly chordal graphs , 1984, Discret. Appl. Math..
[95] Jerzy Topp,et al. Alphak- and Gammak-stable Graphs , 2000, Discret. Math..
[96] Bohdan Zelinka. Remarks on restrained domination and total restrained domination in graphs , 2005 .
[97] Jun-Ming Xu,et al. Roman bondage numbers of some graphs , 2014, Australas. J Comb..
[98] Jinjiang Yuan,et al. Bondage number of planar graphs , 2000, Discret. Math..
[99] Michael A. Henning. Graphs with large restrained domination number , 1999 .
[100] Charles S. Revelle,et al. Defendens Imperium Romanum: A Classical Problem in Military Strategy , 2000, Am. Math. Mon..
[101] Michael A. Henning,et al. A characterization of trees with equal total domination and paired-domination numbers , 2004, Australas. J Comb..
[102] Jun-Ming Xu,et al. The bondage numbers of extended de Bruijn and Kautz digraphs , 2006, Comput. Math. Appl..
[103] Liang Sun,et al. The bondage and connectivity of a graph , 2003, Discret. Math..
[104] Gary MacGillivray,et al. Vertex domination-critical graphs , 1995, Networks.
[105] Wayne Goddard,et al. Independent domination in graphs: A survey and recent results , 2013, Discret. Math..
[106] Ulrich Teschner. The bondage number of a graph G can be much greater than Delta(G) , 1996, Ars Comb..
[107] Jia Huang. An improved upper bound for the bondage number of graphs on surfaces , 2012, Discret. Math..
[108] Jun-Ming Xu,et al. Probabilistic analysis of upper bounds for 2-connected distance k-dominating sets in graphs , 2009, Theor. Comput. Sci..
[110] Hye Kyung Kim,et al. Bondage number of the discrete torus Cn×C4 , 2005, Discret. Math..
[111] F. Harary,et al. On the corona of two graphs , 1970 .
[112] Michael A. Henning,et al. RAINBOW DOMINATION IN GRAPHS , 2008 .
[113] Junming Xu,et al. Trees with unique minimum p-dominating sets ∗ , 2010 .
[114] Odile Favaron,et al. k-Domination and k-Independence in Graphs: A Survey , 2012, Graphs Comb..
[115] Jun-Ming Xu,et al. The total bondage number of grid graphs , 2011, Discret. Appl. Math..
[116] Quentin F. Stout,et al. Perfect Dominating Sets on Cube-Connected Cycles , 1993 .
[117] Vladimir Samodivkin. Domination with respect to nondegenerate properties: bondage number , 2009, Australas. J Comb..
[118] Italo J. Dejter,et al. Efficient dominating sets in Cayley graphs , 2003, Discret. Appl. Math..
[119] Jun-Ming Xu,et al. Distance domination-critical graphs , 2008, Appl. Math. Lett..
[120] Michael A. Henning,et al. Total restrained domination in graphs with minimum degree two , 2008, Discret. Math..
[121] Stephen T. Hedetniemi,et al. Roman domination in graphs , 2004, Discret. Math..