Eulerian Subgraphs and S-connectivity of Graphs

Miaomiao Han and Zhengke Miao

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

Abstract: Collapsible graphs are introduced by Caltin to study Eulerian subgraphs, and S-group-connectivity is introduced by Jaeger et al. to study flows of graphs. Lai established a connection of those graph classes by showing that collapsible graphs have S-connectivity for group S of order 4. In a survey paper in 2011, Lai et al. conjectured that this property holds for all finite Abelian groups of size at least 4. We prove this conjecture for all groups of even order |S| ≥ 4 and of large odd order |S| ≥ 53.

Keywords: Eulerian graphs; Collapsible graphs; Nowhere-zero flow; Connectivity (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320302897
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:382:y:2020:i:c:s0096300320302897

DOI: 10.1016/j.amc.2020.125323

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