A Sufficient Condition of Hamilton Connected Graph

被引：0
|
作者：
YIN Zhi-xiang 1
2.Department of Mathematics and Physics
机构：
来源：
数学季刊 | 2003年 / 01期
关键词：
degree; connected graph; independent set;
D O I：
暂无
中图分类号：
O157.5 [图论];
学科分类号：
070104 ;
摘要：
Let G be a 3-connected graph with n vertices. The paper proves that if for each pair of vertices u and v of G, d(u,v)=2, has ｜N(u)∩N(v)｜≤α(α is the minimum independent set number), and then max{d(u),d(v)}≥n+12, then G is a Hamilton connected graph.
引用
收藏
页码：99 / 102
页数：4
相关论文
共 50 条
  • [1] A Sufficient and Necessary Condition for Hamilton Graph
    Han, Ruo
    2ND INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGY FOR EDUCATION (ICTE 2015), 2015, : 259 - 261
  • [2] Research on Necessary and Sufficient Condition for Hamilton Graph
    Cui, Yan
    Cui, Chao-Dong
    INTERNATIONAL CONFERENCE ON SOLID STATE DEVICES AND MATERIALS SCIENCE, 2012, 25 : 1879 - 1886
  • [3] A NECESSARY AND SUFFICIENT EIGENVECTOR CONDITION FOR A CONNECTED GRAPH TO BE BIPARTITE
    Cioaba, Sebastian M.
    ELECTRONIC JOURNAL OF LINEAR ALGEBRA, 2010, 20 : 351 - 353
  • [4] Note on sufficient condition of Hamilton graphs
    Zhao, Ke-Wen
    Han, Feng
    Li, Da-Chao
    Lanzhou Daxue Xuebao/Journal of Lanzhou University, 2002, 38 (02):
  • [5] Ore type sufficient condition for a graph to be super restricted edge-connected
    Wang, Ying-Qian
    Li, Qiao
    Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University, 2001, 35 (08): : 1253 - 1255
  • [6] A SUFFICIENT CONDITION FOR A GRAPH TO BE HAMILTONIAN
    KOHLER, N
    MONATSHEFTE FUR MATHEMATIK, 1981, 92 (02): : 105 - 116
  • [7] A sufficient condition for a bipartite graph to be a cube
    Wenzel, W
    DISCRETE MATHEMATICS, 2002, 259 (1-3) : 383 - 386
  • [8] A NEW SUFFICIENT CONDITION FOR A GRAPH TO BE HAMILTONIAN
    LIU, ZH
    KEXUE TONGBAO, 1987, 32 (09): : 639 - 640
  • [9] Spectral Conditions for a Graph to be Hamilton-connected
    Yu, Gui-Dong
    Fan, Yi-Zheng
    INDUSTRIAL INSTRUMENTATION AND CONTROL SYSTEMS II, PTS 1-3, 2013, 336-338 : 2329 - +
  • [10] A sufficient condition for a graph to be an (a, b, k)-critical graph
    Zhou, Sizhong
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2010, 87 (10) : 2202 - 2211
12345