Sufficient conditions for graphs to be spanning connected

被引:4
|
作者
Sabir, Eminjan [1 ]
Meng, Jixiang [1 ]
机构
[1] Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Peoples R China
关键词
Degree sequence; Hamiltonicity; Spanning connectivity; Spanning laceability; Structure fault tolerance;
D O I
10.1016/j.amc.2020.125198
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A graph G is t*-connected if there exist t internally disjoint (u, v)-paths, between any two vertices u and v, whose union spans G. In this sense, t*-connectedness is a natural extension of hamiltonicity. In this paper, we provide a sufficient condition for graphs to be t*-connected by generalizing a classic result given by Chavatal [7]. Furthermore, as byproducts, we extend some known results concerning fault tolerant hamiltonicity and minimum cardinality of edges. We also establish analogous results for balanced bipartite graphs. (C) 2020 Elsevier Inc. All rights reserved.
引用
收藏
页数:8
相关论文
共 50 条
  • [1] On sufficient conditions for spanning structures in dense graphs
    Lang, Richard
    Sanhueza-Matamala, Nicolas
    PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 2023, 127 (03) : 709 - 791
  • [2] SUFFICIENT CONDITIONS FOR MAXIMALLY CONNECTED DENSE GRAPHS
    SONEOKA, T
    NAKADA, H
    IMASE, M
    PEYRAT, C
    DISCRETE MATHEMATICS, 1987, 63 (01) : 53 - 66
  • [3] On spanning connected graphs
    Lin, Cheng-Kuan
    Huang, Hua-Min
    Tan, Jimmy J. M.
    Hsu, Lih-Hsing
    DISCRETE MATHEMATICS, 2008, 308 (07) : 1330 - 1333
  • [4] On Sufficient Conditions for k-Leaf-Connected Graphs
    Guoyan AO
    Xia HONG
    Journal of Mathematical Research with Applications, 2024, 44 (06) : 711 - 722
  • [5] Sufficient conditions for maximally restricted edge connected graphs
    Qin, Yingying
    Ou, Jianping
    DISCRETE MATHEMATICS, 2012, 312 (19) : 2969 - 2972
  • [6] SUFFICIENT CONDITIONS FOR LOCALLY CONNECTED GRAPHS - PRELIMINARY REPORT
    VANDERJA.DW
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1974, 21 (01): : A32 - A32
  • [7] Some sufficient conditions on k-connected graphs
    Zhou, Qiannan
    Wang, Ligong
    Lu, Yong
    APPLIED MATHEMATICS AND COMPUTATION, 2018, 325 : 332 - 339
  • [8] Some new sufficient conditions and Hamiltonian connected graphs
    Zhao, Kewen
    Chen, Deqin
    Lin, Yue
    Li, Zu
    Zeng, Keyang
    INTERNATIONAL CONFERENCE ON ADVANCES IN ENGINEERING 2011, 2011, 24 : 278 - 281
  • [9] Sufficient conditions for 2-rainbow connected graphs
    Kemnitz, Arnfried
    Schiermeyer, Ingo
    DISCRETE APPLIED MATHEMATICS, 2016, 209 : 247 - 250
  • [10] Sufficient Conditions for Graphs to Be k-Connected, Maximally Connected, and Super-Connected
    Hong, Zhen-Mu
    Xia, Zheng-Jiang
    Chen, Fuyuan
    Volkmann, Lutz
    COMPLEXITY, 2021, 2021