Characterization of strongly Z-connected graphs of small order
Abstract
A graph is strongly -connected if for each boundary function β: V(G) with β(v) d(v) 2 for every vertex v and Σv ∈ V(G) β(v) 0 2, there exists an orientation D of G such that dD+(v) - dD-(v) β(v) 2 for each v ∈ 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 4-vertex strongly Z-connected graphs for any integer ≥ 2, which will be used in our further study in this topic.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.