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] On the Ace-spectral radius of connected graphs
    Alhevaz, Abdollah
    Baghipur, Maryam
    Ganie, Hilal Ahmad
    Das, Kinkar Chandra
    ARS MATHEMATICA CONTEMPORANEA, 2023, 23 (01)
  • [32] Globally bi-3*-connected graphs
    Kao, Shin-Shin
    Hsu, Hong-Chun
    Hsu, Lih-Hsing
    DISCRETE MATHEMATICS, 2009, 309 (08) : 1931 - 1946
  • [33] Spanning Connectivity of the Power of a Graph and Hamilton-Connected Index of a Graph
    Sabir, Eminjan
    Vumar, Elkin
    GRAPHS AND COMBINATORICS, 2014, 30 (06) : 1551 - 1563
  • [34] Spanning Connectivity of the Power of a Graph and Hamilton-Connected Index of a Graph
    Eminjan Sabir
    Elkin Vumar
    Graphs and Combinatorics, 2014, 30 : 1551 - 1563
  • [35] SUFFICIENT CONDITIONS FOR GRAPHICALITY OF BIDEGREE SEQUENCES
    Burstein, David
    Rubin, Jonathan
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (01) : 50 - 62
  • [36] A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance
    Chen, Y-Chuang
    Huang, Yong-Zen
    Hsu, Lih-Hsing
    Tan, Jimmy J. M.
    JOURNAL OF SUPERCOMPUTING, 2010, 54 (02): : 229 - 238
  • [37] Toughness, Forbidden Subgraphs, and Hamilton-Connected Graphs
    Zheng, Wei
    Broersma, Hajo
    Wang, Ligong
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2022, 42 (01) : 187 - 196
  • [38] A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance
    Y-Chuang Chen
    Yong-Zen Huang
    Lih-Hsing Hsu
    Jimmy J. M. Tan
    The Journal of Supercomputing, 2010, 54 : 229 - 238
  • [39] THE CONNECTED GRAPHS OBTAINED FROM FINITE PROJECTIVE PLANES
    Akpinar, Atilla
    RAD HRVATSKE AKADEMIJE ZNANOSTI I UMJETNOSTI-MATEMATICKE ZNANOSTI, 2022, 26 (551): : 1 - 20
  • [40] On general ABC-type index of connected graphs
    Chen, Chaohui
    Liu, Muhuo
    Chen, Xiaodan
    Lin, Wenshui
    DISCRETE APPLIED MATHEMATICS, 2022, 315 : 27 - 35