paper

Characterization of strongly -connected graphs of small order

arXiv:2603.21591

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.