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] Sufficient conditions for maximally restricted edge connected graphs
    Qin, Yingying
    Ou, Jianping
    DISCRETE MATHEMATICS, 2012, 312 (19) : 2969 - 2972
  • [2] Packing spanning trees in highly essentially connected graphs
    Lai, Hong-Jian
    Li, Jiaao
    DISCRETE MATHEMATICS, 2019, 342 (01) : 1 - 9
  • [3] On sufficient conditions for Hamiltonicity of graphs, and beyond
    Liu, Hechao
    You, Lihua
    Huang, Yufei
    Du, Zenan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2024, 47 (02)
  • [4] On sufficient conditions for Hamiltonicity of graphs, and beyond
    Hechao Liu
    Lihua You
    Yufei Huang
    Zenan Du
    Journal of Combinatorial Optimization, 2024, 47
  • [5] Polynomially determining spanning connectivity of locally connected line graphs
    Xiong, Wei
    Song, Sulin
    Xie, Yikang
    Zhan, Mingquan
    Lai, Hong-Jian
    DISCRETE APPLIED MATHEMATICS, 2021, 295 (295) : 102 - 111
  • [6] Cubic 1-fault-tolerant hamiltonian graphs, Globally 3*-connected graphs, and Super 3-spanning connected graphs
    Kao, Shin-Shin
    Huang, Hua-Min
    Hsu, Kung-Ming
    Hsu, Lih-Hsing
    ARS COMBINATORIA, 2013, 110 : 301 - 322
  • [7] The spanning connectivity of the arrangement graphs
    Teng, Yuan-Hsiang
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2016, 98 : 1 - 7
  • [8] On sufficient degree conditions for traceability of claw-free graphs
    Tian, Tao
    Broersma, Hajo
    Xiong, Liming
    DISCRETE MATHEMATICS, 2020, 343 (07)
  • [9] On the spanning connectivity of graphs
    Lin, Cheng-Kuan
    Huang, Hua-Min
    Hsu, Lih-Hsing
    DISCRETE MATHEMATICS, 2007, 307 (02) : 285 - 289
  • [10] Sufficient conditions for hamiltonian properties of graphs based on the difference of Zagreb indices
    Jin, Yuxin
    Zhou, Shuming
    Tian, Tao
    Das, Kinkar Chandra
    COMPUTATIONAL & APPLIED MATHEMATICS, 2024, 43 (06):