Contents

-

Divergence Condition for Pancyclicity

R.E.L. Aldred1, D.A. Holton1, Dingjun Lou2, Ronghua Shi3
1 Department of Mathematics and Statistics University of Otago Dunedin, New Zealand
2Department of Computer Science Zhongshan University Guangzhou 510275 People’s Republic of China
3Department of Applied Mathematics East China Institute of Technology Nanjing 210014 People’s Republic of China

Abstract

Let G be a connected graph and let u and v be two vertices of G such that dG(u,v)=2. We define their divergence to be: α(u,v)=maxw{|S| for each wNG(u)NG(v),S is a maximum independent set in NG(w) containing u and v}. It is proved that if for each pair of vertices u and v of G such that dG(u,v)=2, |NG(u)NG(v)|α(u,v) and if ν(G)3, then G is pancyclic unless G is Kν/2,ν/2. Several previously known sufficient conditions for pancyclicity follow as corollaries.