拟无爪哈密尔顿图的邻集条件(英文)

马小玲

您当前的位置：

首页 >

文章列表页 >

拟无爪哈密尔顿图的邻集条件(英文)

更新时间：2026-01-21

- 拟无爪哈密尔顿图的邻集条件(英文)
- Journal of Xinjiang University (Natural Science Edition in Chinese and English) Vol. 26, Issue 2, Pages: 155-158(2009)
- 作者机构：
  
  新疆大学数学与系统科学学院
- 作者简介：
- 基金信息：
- DOI：
  CLC： O157.5
- Published：2009
- 稿件说明：
移动端阅览
[1]马小玲.拟无爪哈密尔顿图的邻集条件(英文)[J].新疆大学学报(自然科学版),2009,26(02):155-158.

马小玲. 拟无爪哈密尔顿图的邻集条件(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2009, 26(2): 155-158.
[1]马小玲.拟无爪哈密尔顿图的邻集条件(英文)[J].新疆大学学报(自然科学版),2009,26(02):155-158. DOI：

马小玲. 拟无爪哈密尔顿图的邻集条件(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2009, 26(2): 155-158. DOI：

摘要

作为无爪图的一种推广

拟无爪图类由Ainouche引入.已经知道:如果阶数为n的3-连通无爪图G

对于每一对距离为2的点都有|N(x)∪N(y)|≥(2n-6)/3

那么图G是哈密尔顿的.在本文中

推广了上述的结论并且得到:如果阶数为n的3-连通拟无爪图G

对于每一对距离为2的点都有|N(x)∪N(y)|≥(2n-6)/3

那么图G是哈密尔顿的.

Abstract

As a generalization of claw-free graphs

the class of quasi claw-free graphs was introduced by Ainouche.It is known that:if G is a 3-connected K1

3-free graph of order n such that |N(x)∪N(y)|≥(2n-6)/3 for each pair of vertices x

y with d(x

y)=2

then G is Hamiltonian.In this paper

we extend the above result and obtain:if G is a 3-connected quasi claw-free graph of order n such that |N(x)∪N(y)|≥(2n-6)/3 for each pair of vertices x

y with d(x

y)=2

then G is Hamiltonian.

关键词

Keywords

references

West D B.Introduction to Graph Theory,Second Edition[M],Prentice Hall,Upper Saddle River,NJ(2001).

Ainouche A.Quasi claw-free graphs[J].Discrete Math,1998,129:13-26.

Faudree R J,R J Gould,Lindquester T E.Hamilltonian properties and adjacency conditions in K1,3-free graphs,Proceed- ings of the 6th International Conference on Theory and Applications of Graphs[A].Kalamazoo,1988.

T E Lindquester.The effects of distance and neighborhood union conditions on Hamiltonian properties in graphs[J].J Graph Theory,1991,13:139-148.

Zhao Kewen,Liu Bolian.A Neighborhood condition for vertices at distance two impling Hamiltonian[J].Soochow J Math- ematics,2006,32,71-177.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

图的生成可圈性（英文）

Related Author

齐豪

艾尔肯·吾买尔

Related Institution

No data

⁰