摘要
设G是K-连通简单图(K≥3),若对任一K阶独立集S,u,v∈S,d(u)+d(v)≥n-1成立,则除一些例外图外,G是Hamilton连通。
Let G be a K-connected simply graph (K≥3), If for any independent set S with cardinality
K and for any pair of vertices u,v∈s,d(u)+d(v)≥n-1 hold, then G is Hamilton-connected except
some special graphs.
出处
《安徽大学学报(自然科学版)》
CAS
1999年第2期17-19,共3页
Journal of Anhui University(Natural Science Edition)