Pancyclism of 3-domination-critical graphs with small minimum degree | |
Shiu, W. C. ; Zhang, L. Z. ; Zhang LZ(张莲珠) | |
2008-03 | |
关键词 | DOMINATION-CRITICAL GRAPHS HAMILTONICITY INDEPENDENCE |
英文摘要 | A graph G is 3-domination-critical if its domination number gamma is 3 and the addition of any edge decreases gamma by 1. Let G be a connected 3-domination-critical graph of order n. Shao etc. proved that if delta(G) >= 3 then G is pancyclic, i.e. G contains cycles of each length k, 3 <= k <= n. In this paper, we prove that the number of 2-vertices in G is at most 3. Using this result, we prove that the graph G-V-1 is pancyclic, where V, is the set of all 1-vertices in G, except G is isomorphic to the graph of order 7 well-defined in the context. |
语种 | 英语 |
内容类型 | 期刊论文 |
源URL | [http://dspace.xmu.edu.cn/handle/2288/66373] ![]() |
专题 | 数学科学-已发表论文 |
推荐引用方式 GB/T 7714 | Shiu, W. C.,Zhang, L. Z.,Zhang LZ. Pancyclism of 3-domination-critical graphs with small minimum degree[J],2008. |
APA | Shiu, W. C.,Zhang, L. Z.,&张莲珠.(2008).Pancyclism of 3-domination-critical graphs with small minimum degree.. |
MLA | Shiu, W. C.,et al."Pancyclism of 3-domination-critical graphs with small minimum degree".(2008). |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论