On spanning connected graphs

Cheng-Kuan Lin, Hua-Min Huang, Jiann-Mean Tan, Lih-Hsing Hsu

研究成果: Article同行評審

21 引文 斯高帕斯(Scopus)

摘要

A k-container C(u, v) of G between u and v is a set of k internally disjoint paths between u and v. A k-container C(u, v) of G is a k*-container if the set of the vertices of all the paths in C(u, v) contains all the vertices of G. A graph G is k*-connected if there exists a k*-container between any two distinct vertices. Therefore, a graph is 1*-connected (respectively, 2*-connected) if and only if it is hamiltonian connected (respectively, hamiltonian). In this paper, a classical theorem of Ore, providing sufficient conditional for a graph to be hamiltonian (respectively, hamiltonian connected), is generalized to k*-connected graphs. (c) 2007 Published by Elsevier B.V.
原文English
頁(從 - 到)1330-1333
頁數4
期刊Discrete Mathematics
308
發行號7
DOIs
出版狀態Published - 6 四月 2008

指紋

深入研究「On spanning connected graphs」主題。共同形成了獨特的指紋。

引用此