HAMILTONIAN GRAPHS INVOLVING NEIGHBORHOOD INTERSECTIONS

被引：4

作者：

CHEN, GT

机构：

[1] Department of Mathematics, North Dakota State University, Fargo

来源：

DISCRETE MATHEMATICS | 1993年 / 112卷 / 1-3期

关键词：

D O I：

10.1016/0012-365X(93)90238-O

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let G be a graph of order n and alpha the independence number of G. We show that if G is a 2-connected graph and max {d(u), d(v)} greater-than-or-equal-to n/2 for each pair of non-adjacent vertices u,v with 1 less-than-or-equal-to \N(u) and N(v)\ less-than-or-equal-to alpha-1, then G is hamiltonian. This result generalizes Fan's (1984) result on hamiltonian graphs.

引用

页码：253 / 257

页数：5