摘要
本文考虑图G中满足d(u,υ)=2的任意两点u和υ,得到如下结果:设G是阶为n的2-连通图,若δ(G)≥4,|N(u)U N(v)|>n-3,则G是点泛圈的;若δ(G)≥t,|N(u)t N(v)|≥n-t,则G是Hamiltonian。
In this paper, by examining the bounds on |N(u)UN (v)|, for u, v∈V(G) and d(u, v)=2, it shows that if G is a 2-connected graph of order n with δ(G)≥4, |N(u)UN(v)|≥n-3, then G is vertex pancyclic, if δ(G)≥t and |N(u)UN(v)|≥n-t, then G is Hamiltonian.
出处
《东南大学学报（自然科学版）》
EI
CAS
CSCD
1991年第1期97-100,共4页
Journal of Southeast University：Natural Science Edition
关键词
图
哈密顿性
邻域并
点泛圈
Hamiltonian / neighborhood unions, vertex pancyclic
