Journal of Hebei University(Natural Science Edition) >

2006 , Vol. 26 >Issue 5: 456 - 459

DOI: https://doi.org/10.3969/j.issn.1000-1565.2006.05.003

Upper Bounds for the Domination Number of a Kind of Hamiltonian Graphs

  • LI Tong-sheng ,
  • XING Hua-ming ,
  • GUO Yan-ping ,
  • SHI Hai-yan
Expand

Online published: 2006-09-25

Fold

Cite this article

LI Tong-sheng , XING Hua-ming , GUO Yan-ping , SHI Hai-yan . Upper Bounds for the Domination Number of a Kind of Hamiltonian Graphs[J]. Journal of Hebei University(Natural Science Edition), 2006 , 26(5) : 456 -459 . DOI: 10.3969/j.issn.1000-1565.2006.05.003

References

[1] 邢化明, 王小英, XING Hua-ming, WANG Xiao-ying. 一类图的控制数的上界 [J]. 廊坊师范学院学报 2004.doi:10.3969/j.issn.1674-3210.2004.04.007
[2] GAREY M R, JOHNSON D S. Computers and intractability:a guide to the theory of NP-completeness [M]. San Franciso:W H Freeman 1979.
[3] ORE O. Theory of graphs [M]. Providence:Amer Math Soc Colloq Pub 1962.
[4] MCGUAIG W, SHEPHERD B. Domination in graphs with minimum degree two [J]. Journal of Graph Theory 1989, 13.
[5] REED B. PATHS, stars and the number three [J]. Comb Prob Comp 1996, 5.
[6] HAYNES T W, HEDETNIEMI S T, SLATER P J. Fundamentals of domination in graphs [M]. New Youk:Marcel Dekker 1998.
[7] CARO Y, RODITTY Y. A note on the k-domination number of a graph [J]. International Journal of Mathematics and Mathematical Sciences 1990, 13.
[8] CLARK W E, DUNNING L A. Tight upper bounds for the domination numbers of graphs with given order and minimum degree [J]. Electronic journal of Combinatorics 1997, 4.
Options
Outlines

/

〈 〉