2020/09/15 by Miaomiao Han, Jiaao Li, Han, Miaomiao +5
Computer Science · #05C15 #05C21 #05C40 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #Interconnection Networks and Systems
paper · pdf · doi:10.48550/arxiv.2009.06867
openalex publication_date 2020/09/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Let S,T be two distinct finite Abelian groups with |S|=|T|. A fundamental theorem of Tutte shows that a graph admits a nowhere-zero S-flow if and only if it admits a nowhere-zero T-flow. Jaeger, Linial, Payan and Tarsi in 1992 introduced group connectivity as an extension of flow theory, and they asked whether such a relation holds for group connectivity analogy. It was negatively answered by Hušek, Mohelníková and Šámal in 2017 for graphs with edge-connectivity 2 for the groups S=ℤ4 and T=ℤ22. In this paper, we extend their results to 3-edge-connected graphs (including both cubic and general graphs), which answers open problems proposed by Hušek, Mohelníková and Šámal(2017) and Lai, Li, Shao and Zhan(2011). Combining some previous results, this characterizes all the equivalence of group connectivity under 3-edge-connectivity, showing that every 3-edge-connected S-connected graph is T-connected if and only if \S,T\≠ \ℤ4,ℤ22\.