摘要
图的完全圈可扩性是图的圈性质中最强的性质,这使得对图的完全圈可扩性的研究尤为重要。研究了5-点连通图的完全圈可扩性,并证明了顶点数不小于9的5-点连通图是完全圈可扩的。从而推广了马浩静和石玉华提出的相关结果。
The full cycle extensibility of a graph is the strongest one of the cycle properties of graphs, so the study on the full cycle extensibility of a graph is more important. This paper studies the full cycle extensibility of 5-vertex connected graph, and proves that a 5-vertex connected graph whose vertices are not less than 9 is extensible full cycle. Then, some known results of MA Hao-jing and SHI Yu-hua are popularized.
出处
《山东科技大学学报（自然科学版）》
CAS
2006年第4期107-109,共3页
Journal of Shandong University of Science and Technology(Natural Science)
关键词
连通
s-点连通图
完全圈可扩性
connection
s-vertex connected graph
full cycle extensibility
