English

Characterization of strongly $\mathbb{Z}_\ell$-connected graphs of small order

Combinatorics 2026-03-25 v2

Abstract

A graph is strongly Z\Z_{\ell}-connected if for each boundary function β:V(G)Z\beta: V(G)\mapsto \Z_{\ell} with β(v)d(v)(mod2)\beta(v) \equiv d(v) \pmod{2} for every vertex vv and vV(G)β(v)0(mod2)\sum_{v \in V(G)} \beta(v) \equiv 0 \pmod{2\ell}, there exists an orientation DD of GG such that dD+(v)dD(v)β(v)(mod2)d_D^+(v) - d_D^-(v) \equiv \beta(v) \pmod{2\ell} for each vV(G)v \in V(G). This is a useful notion for studying circular flows of graphs. This note presents a fully self-contained, manual proof of a characterization of 44-vertex strongly Z\mathbb{Z}_\ell-connected graphs for any integer 2\ell\geq 2, which will be used in our further study in this topic.

Keywords

Cite

@article{arxiv.2603.21591,
  title  = {Characterization of strongly $\mathbb{Z}_\ell$-connected graphs of small order},
  author = {Jiaao Li and Bo Su and Zhouningxin Wang and Chunyan Wei},
  journal= {arXiv preprint arXiv:2603.21591},
  year   = {2026}
}