期刊文献+

一类亚几乎唯一泛圈图

A Class of Sub-almost Uniquely Pancyclic Graphs
下载PDF
导出
摘要 设G是阶为n的简单Hamilton图,若存在不同的p,q(3≤p<n,3≤q<n)使对每个l∈{3,4…,n}-{p,q},恰有一个长为l的圈且不含长为p,q的圈,则称G为亚几乎唯一泛圈图。用Γk表示具有n+k条边恰有12(k+1)(k+2)个圈的阶为n的简单Hamilton图的集合。本文确定了Γk中的所有亚几乎唯一泛圈图。并证明这些图除了一个5圈外都是简单MCD图。 Let G be a simple Hamilton graph with n vertices,If there exists p,q such that G contains exactly one cycle of length for every and contains no cycle of length of p,q.then G is called sub-almost uniquely pancyclic graph.Let denote the set of simple Hamilton graphs with n+k edges and cycles,In this paper all sub-almost uniquely pancyclic graphs in are determined and it is proved that they are all simple MCD graphs except 5 cycle.
作者 周仲旺
机构地区 潍坊学院
出处 《潍坊学院学报》 2008年第2期100-102,106,共4页 Journal of Weifang University
关键词 HAMILTON图 简单MCD图 亚几乎唯一泛圈图 cycle Hamilton graph simple MCD graph sub-almost uniquely pancyclic graph
  • 相关文献

参考文献1

二级参考文献10

  • 1Bondy,J.A.,Murty,U.S.R.,Graph Theory with Applications,Macmillan Press,1976.
  • 2Shi Yongbing,On maximum cycle-distributed graphs,Discrete Math.,1988,71:57-71.
  • 3Shi Yongbing,The number of edges in a maximum cycle-distributed graph,Discrete Math.,1992,104:205-209.
  • 4Shi Yongbing,On Simple MCD graphs containing a subgraph homeomorphic to K4,Discrete Math.,1994,126:325-338.
  • 5Boros,E.,Caro,Y.,Fiiredi,Z.and Yuster,R.,Covering non-uniform hypergraphs,J.of Combinatorial Theory B,2001,82:270-284.
  • 6Lai Chunhui,Graphs without repeated cycle lengths,Australasian J.of Combinatorics,2003:101-105.
  • 7Shi Yongbing,Some theorems of uniquely pancyclic graphs,Discrete Math.,1986,59:167-180.
  • 8Shi Yongbing,The number of cycles in a hamilton graph,Discrete Math.,1994,133:249-257.
  • 9Bondy,J.A.,Lovasz,L.,Length of cycles in Halin graphs,J.of Graph Theory,1985,9(3):397-410.
  • 10Malkevitch,J.,Cycle lengths in polytopal graphs,Lecture Notes in Math.,1978,642:364-370.

共引文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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