On spanning laceability of bipartite graphs

Eminjan Sabir, Jixiang Meng and Hongwei Qiao

Applied Mathematics and Computation, 2024, vol. 480, issue C

Abstract: Let G=(A,B;E) be a balanced bipartite graph with bipartition (A,B). For a positive integer t and two vertices a∈A and b∈B, a bi-(t;a,b)-path-system of G is a subgraph S consisting of t internally disjoint (a,b)-paths. Moreover, a bi-(t;a,b)-path-system is called a spanning bi-(t;a,b)-path-system if V(S) spans V(G). If there is a spanning bi-(t;a,b)-path-system between any a∈A and b∈B then G is said to be spanning t-laceable. In this paper, we provide a synthesis of sufficient conditions for a bipartite graph to be spanning laceable in terms of extremal number of edges, bipartite independence number, bistability, and biclosure. As a byproduct, a classic result of Moon and Moser (1963) [9] is extended.

Keywords: Bipartite graph; Biclosure; Hamiltonicity; Spanning disjoint paths (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324003801
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:480:y:2024:i:c:s0096300324003801

DOI: 10.1016/j.amc.2024.128919

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 ().