中文

Journal of Applied Sciences ›› 2003, Vol. 21 ›› Issue (4): 431-434.

• Articles • Previous Articles    

A Sufficient Condition and a Study of Hamilton-Connected Graphs

ZHAO Ke-wen1,2, ZENG Ke-yang1   

  1. 1. Department of Mathematics, Qiongzhou University, Wuzhishan 572200, China;
    2. Department ofMathematics, Hainan Normal University, Haikou 571100, China
  • Received:2001-09-20 Revised:2003-02-11 Online:2003-12-10 Published:2003-12-10

PDF

68

Cited

1

Abstract: Let G=(V,E) be the simple graph of order n, this shows a new sufficient condition HN ≥ n which imply the three improves and generalizes basic sufficient conditions of Dirac, Ore and neighborhood union. A study of the Hamiltonian, Hamilton connected graphs with HN ≥ n has also been made.

Key words: new sufficient condition, Hamilton-connected graph, Hamiltonian

CLC Number: