The product of the restrained domination numbers of a graph and its complement
暂无分享,去创建一个
[1] Johannes H. Hattingh,et al. On equality in an upper bound for the restrained and total domination numbers of a graph , 2007, Discret. Math..
[2] Michael A. Henning,et al. Total restrained domination in graphs with minimum degree two , 2008, Discret. Math..
[3] E. A. Nordhaus,et al. On Complementary Graphs , 1956 .
[4] Johannes H. Hattingh,et al. Restrained domination in graphs , 1999, Discret. Math..
[5] Johannes H. Hattingh,et al. Restrained domination in trees , 2000, Discret. Math..
[6] 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..
[7] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.
[8] Seyed Mahmoud Sheikholeslami,et al. Connected Domination Number of a Graph and its Complement , 2012, Graphs Comb..
[9] Jan Arne Telle,et al. Algorithms for Vertex Partitioning Problems on Partial k-Trees , 1997, SIAM J. Discret. Math..
[10] Bohdan Zelinka. Remarks on restrained domination and total restrained domination in graphs , 2005 .
[11] Liang Sun,et al. On total restrained domination in graphs , 2005 .
[12] S. Hedetniemi,et al. Domination in graphs : advanced topics , 1998 .
[13] Johannes H. Hattingh,et al. Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs , 2008, Discret. Math..