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 条
  • [31] Enumerating spanning and connected subsets in graphs and matroids
    Khachiyan, L.
    Boros, E.
    Borys, K.
    Elbassioni, K.
    Gurvich, V.
    Makino, K.
    ALGORITHMS - ESA 2006, PROCEEDINGS, 2006, 4168 : 444 - 455
  • [32] Enumerating spanning and connected subsets in graphs and matroids
    Khachiyan, Leonid
    Boros, Endre
    Borys, Konrad
    Elbassioni, Khaled
    Gurvich, Vladimir
    Makino, Kazuhisa
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 2007, 50 (04) : 325 - 338
  • [33] Spanning 3-connected index of graphs
    Xiong, Wei
    Zhang, Zhao
    Lai, Hong-Jian
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 27 (01) : 199 - 208
  • [34] Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius
    Zhou, Qiannan
    Wang, Ligong
    Lu, Yong
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2020, 594 (594) : 205 - 225
  • [35] Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
    Meierling, Dirk
    Volkmann, Lutz
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (12) : 1775 - 1781
  • [36] SUFFICIENT CONDITIONS FOR CIRCUITS IN GRAPHS
    WOODALL, DR
    PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 1972, 24 (04) : 739 - &
  • [37] SUFFICIENT CONDITIONS FOR TRACEABLE GRAPHS
    AINOUCHE, A
    ARS COMBINATORIA, 1990, 29B : 129 - 142
  • [38] Sufficient Spectral Radius Conditions for Hamilton-Connectivity of k-Connected Graphs
    Zhou, Qiannan
    Broersma, Hajo
    Wang, Ligong
    Lu, Yong
    GRAPHS AND COMBINATORICS, 2021, 37 (06) : 2467 - 2485
  • [39] SUFFICIENT CONDITIONS FOR MAXIMALLY EDGE-CONNECTED AND SUPER-EDGE-CONNECTED GRAPHS DEPENDING ON THE CLIQUE NUMBER
    Volkmann, Lutz
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2019, 39 (02) : 567 - 573
  • [40] Highly Connected Graphs Have Highly Connected Spanning Bipartite Subgraphs
    Yuster, Raphael
    ELECTRONIC JOURNAL OF COMBINATORICS, 2024, 31 (01):