泛圈性、泛连通性和哈密尔顿性的一些重要结果的统一及改进

吉林大学学报(工学版) ›› 2001, Vol. ›› Issue (4): 59-62.

泛圈性、泛连通性和哈密尔顿性的一些重要结果的统一及改进

赵克文

琼州大学数学系, 海南五指山, 572200

收稿日期:2000-11-05 出版日期:2001-10-25

The Progress on Panconnected Graphs

ZHAO Ke-wen

Dept of Mathematics, Qiong Zhou University, Wuzhishan 572200, China

Received:2000-11-05 Online:2001-10-25

摘要/Abstract

摘要： 设x,y为满足d(x,y)=2的任意两点,研究了d(x)+d(y)≥n+1条件下的n阶图G的泛连通性,改进或推广了文献[1～3]的结果.

关键词: 哈密尔顿性, 泛连通性, 邻域并

Abstract: The author studies the panconnected graphs under the condition that d(x)+d(y)≥n+1, which improves the result in reference[1], [2] and [3], let x, y satifsying d(x, y) = 2.

Key words: hamiltonian, panconnected graphs, NC

中图分类号:

O157.5

赵克文. 泛圈性、泛连通性和哈密尔顿性的一些重要结果的统一及改进[J]. 吉林大学学报(工学版), 2001, (4): 59-62.

ZHAO Ke-wen . The Progress on Panconnected Graphs[J]. 吉林大学学报(工学版), 2001, (4): 59-62.

[1] Faudree R J,Scheld R H.Path connected graphs［J］.Acad Sci. Hungar, 1974(25):313～319.
[2] Willaimson J. Panconnected graphs Ⅱ ［J］. Period. Math. Hungar, 1977(8): 105 ～116.
[3] Faudree R J, Gould R J, Jacobson M A, et al. Neighborhood unions and highly hamiltonian graphs［J］. ARS Combinatorial,1991 (31): 139～148.
[4] 田丰,马仲藩.图与网络流理论［M］.北京:科学出版社,1987.
[5] 宋增民.图论与网络最优化［M］.南京:东南大学出版社,1990.
[6] Bondy J A, Murty U S R. Graph theory with applications［M］. London:Macmillan, 1976.
[7] Bauer D, Fan G H, Veldman H. Hamiltonian properties of graphs with large neighborhood unions［J］. Di~rete Math., 1991(96) :33～49.

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed