Characterization of strongly $\mathbb{Z}_\ell$-connected graphs of small order
Combinatorics
2026-03-25 v2
Abstract
A graph is strongly -connected if for each boundary function with for every vertex and , there exists an orientation of such that for each . This is a useful notion for studying circular flows of graphs. This note presents a fully self-contained, manual proof of a characterization of -vertex strongly -connected graphs for any integer , 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}
}