数学物理学报(英文版) ›› 2000, Vol. 20 ›› Issue (1): 76-78.

• 论文 • 上一篇    下一篇

LOCALIZATION THEOREM ON HAMILTONIAN GRAPHS

 潘林强, 张克民, 周国飞   

  1. Department of Mathematics, Nanjing University, Nanjing 210093, China
  • 出版日期:2000-01-07 发布日期:2000-01-07
  • 基金资助:

    The project supported by NSFC.

LOCALIZATION THEOREM ON HAMILTONIAN GRAPHS

 PAN Lin-Jiang, ZHANG Ke-Min, ZHOU Guo-Fei   

  1. Department of Mathematics, Nanjing University, Nanjing 210093, China
  • Online:2000-01-07 Published:2000-01-07
  • Supported by:

    The project supported by NSFC.

摘要:

Let G be a 2-connected graph of order n( 3). If I(u, v)  S(u, v) or max {d(u), d(v)}  n/2 for any two vertices u, v at distance two in an induced subgraph K1 ,3 or P3 of G , then G is hamiltonian. Here I(u, v) = |N(u)\N(v)|, S(u, v) denotes the number of edges of maximum star containing u, v as an induced subgraph in G.

关键词: Local condition, Hamilton cycle

Abstract:

Let G be a 2-connected graph of order n( 3). If I(u, v)  S(u, v) or max {d(u), d(v)}  n/2 for any two vertices u, v at distance two in an induced subgraph K1 ,3 or P3 of G , then G is hamiltonian. Here I(u, v) = |N(u)\N(v)|, S(u, v) denotes the number of edges of maximum star containing u, v as an induced subgraph in G.

Key words: Local condition, Hamilton cycle

中图分类号: 

  • 05C38