The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs

Gábor Horváth, Chrystopher L. Nehaniv, Károly Podoski

The flow semigroup, introduced by John Rhodes, is an invariant for digraphs and a complete invariant for graphs. After collecting together previous partial results, we refine and p…