期刊文献+

一类图的控制数的上界 被引量:1

Upper Bounds for the Domination Number of a Kind of Graphs
下载PDF
导出
摘要 文章证明了命题:如果一个最小度为4的n阶图中存在一个哈密顿圈。 This paper proves that if a graph G of order n with minimum degree at least four has a Hamiltonian cycle, the domination number of G is at most 4n/11.
出处 《廊坊师范学院学报》 2004年第4期21-23,共3页 Journal of Langfang Teachers College
关键词 控制 控制数 上界 Domination Domination number Upper bounds
  • 相关文献

参考文献6

  • 1[1]Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Franciso, 1979.
  • 2[2]Ore O. Theory of Graphs. Amer. Math. Soc. Colloq. Publ. (Amer. Math. Soc., Providence, RI), 1962, 38.
  • 3[3]McGuaig W, Shepherd B. Domination in graphs with minimum degree two. J. Graph Theory, 1989, 13: 749-762.
  • 4[4]Reed B. Paths, stars, and the number three. Comb Prob Comp, 1996, 5: 277-295.
  • 5[5]Haynes T W, Hedetniemi S T, Slater P J. Fundamentals of domination in graphs. New York: Marcel Dekker, 1998.
  • 6[6]Clark W E, Dunning L A. Tight upper bounds for the domination numbers of graphs with given order and minimum degree. Electronic Journal of Combinatorics, 1997,4: #R26.

同被引文献7

  • 1GAREY M R,JOHNSON D S.Computers and intractability:a guide to the theory of NP-completeness[M].San Franciso:W H Freeman,1979.
  • 2ORE O.Theory of graphs[M].Providence:Amer Math Soc Colloq Pub,1962.
  • 3REED B.PATHS,stars and the number three[J].Comb Prob Comp,1996,5:277-295.
  • 4MCGUAIG W,SHEPHERD B.Domination in graphs with minimum degree two[J].J Graph Theory,1989,13:749-762.
  • 5HAYNES T W,HEDETNIEMI S T,SLATER P J.Fundamentals of domination in graphs[M].New Youk:Marcel Dekker,1998.
  • 6CARO Y,RODITTY Y.A note on the k-domination number of a graph[J].Internat J Math Sci,1990,13:205-206.
  • 7CLARK 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:1-25.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部