We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs.
- Authors
Horváth, Gábor; Nehaniv, Chrystopher L.; Podoski, Károly
- Abstract
The flow semigroup, introduced by Rhodes, is an invariant for digraphs and a complete invariant for graphs. After collecting previous partial results together, we refine and prove Rhodes's conjecture on the structure of the maximal groups in the flow semigroup for finite, antisymmetric, strongly connected digraphs. Building on this result, we investigate and fully describe the structure and actions of the maximal subgroups of the flow semigroup acting on all but points for all finite digraphs and graphs for all . A linear algorithm (in the number of edges) is presented to determine these so-called 'defect groups' for any finite (di)graph. Finally, we prove that the complexity of the flow semigroup of a 2-vertex connected (and strongly connected di)graph with vertices is , completely confirming Rhodes's conjecture for such (di)graphs.
- Subjects
DIRECTED graphs; ALGORITHMS; PERMUTATION groups; INVARIANTS (Mathematics); GEOMETRIC vertices
- Publication
International Journal of Algebra & Computation, 2017, Vol 27, Issue 7, p863
- ISSN
0218-1967
- Publication type
Article
- DOI
10.1142/S0218196717500412