On the domination number of Hamiltonian graphs with minimum degree six
暂无分享,去创建一个
[1] Yair Caro,et al. A note on the k-domination number of a graph , 1990 .
[2] O. Ore. Theory of Graphs , 1962 .
[3] Liang Sun,et al. Domination in Graphs of Minimum Degree Five , 2006, Graphs Comb..
[4] Yuan Xudong,et al. DOMINATION IN GRAPHS OF MINIMUM DEGREE FOUR , 2009 .
[5] Gary Chartrand,et al. Graphs & Digraphs: Third Edition , 1996 .
[6] W. Edwin Clark,et al. Tight Upper Bounds for the Domination Numbers of Graphs With Given Order and Minimum Degree , 1997, Electron. J. Comb..
[7] Bruce A. Reed. Paths, Stars and the Number Three , 1996, Comb. Probab. Comput..
[8] G. Chartrand,et al. Graphs & Digraphs , 1986 .
[9] F. Bruce Shepherd,et al. Domination in graphs with minimum degree two , 1989, J. Graph Theory.
[10] S. Hedetniemi,et al. Domination in graphs : advanced topics , 1998 .
[11] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.