J4

Previous Articles     Next Articles

Pathconnected Graphs with Neighborhood Union Conditions

ZHAO Ke-wen1,2, ZENG Ke-yang1   

  1. 1. Department of Mathematics, Qiongzhou University, Wuzhishan 572200, China;2. Department of Mathematics, Hainan Normal University, Haikou 571100, China
  • Received:2002-08-20 Revised:1900-01-01 Online:2003-04-26 Published:2003-04-26
  • Contact: ZHAO Ke-wen

Abstract: Let Pnm-pathconnected denote the graph of eac h pair of vertices that has paths each order from m to n, the following result i s obtained: for a 2-connected graph of order n(n≥6), if NC≥n-δ+1, then G is Pn6-pathconnected graphs or G=G2: (Ks+Kh), the result has also improved some results by Faudree etal and Wei Bing, Zhu Yong-jun.

Key words: pathconnected graphs, neighborhood unions, paths

CLC Number: 

  • O157.5