Sufficient conditions for graphs to be spanning connected

Eminjan Sabir and Jixiang Meng

Applied Mathematics and Computation, 2020, vol. 378, issue C

Abstract: 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 Chavátal [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.

Keywords: Degree sequence; Hamiltonicity; Spanning connectivity; Spanning laceability; Structure fault tolerance (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320301673
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:378:y:2020:i:c:s0096300320301673

DOI: 10.1016/j.amc.2020.125198

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().