dc.contributor.author | Horváth, Gábor | |
dc.contributor.author | Nehaniv, Chrystopher | |
dc.contributor.author | Podoski, Károly | |
dc.date.accessioned | 2018-01-30T22:12:40Z | |
dc.date.available | 2018-01-30T22:12:40Z | |
dc.date.issued | 2017-11-30 | |
dc.identifier.citation | Horváth , G , Nehaniv , C & Podoski , K 2017 , ' The Maximal Subgroups and the Complexity of the Flow Semigroup of Finite (Di)graphs ' , International Journal of Algebra and Computation , vol. 27 , no. 7 , pp. 863-886 . https://doi.org/10.1142/S0218196717500412 | |
dc.identifier.issn | 0218-1967 | |
dc.identifier.uri | http://hdl.handle.net/2299/19641 | |
dc.description | Preprint of an article first published online in International Journal of Algebra and Computation, September 2017, doi: https://doi.org/10.1142/S0218196717500412. © 2017 Copyright World Scientific Publishing Company. http://www.worldscientific.com/worldscinet/ijac. Accepted Manuscript version is under embargo. Embargo end date: 26 September 2018. | |
dc.description.abstract | The flow semigroup, introduced by John Rhodes, is an invariant for digraphs and a complete invariant for graphs. We refine and prove Rhodes's conjecture on the structure of the maximal groups in the flow semigroup for finite, antisymmetric, strongly connected graphs. 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 k points for all finite digraphs and graphs for all k >=1. A linear algorithm is presented to determine these so-called 'defect k 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 n vertices is n- 2, completely confirming Rhodes's conjecture for such (di)graphs. | en |
dc.format.extent | 24 | |
dc.format.extent | 797929 | |
dc.format.extent | 702132 | |
dc.language.iso | eng | |
dc.relation.ispartof | International Journal of Algebra and Computation | |
dc.title | The Maximal Subgroups and the Complexity of the Flow Semigroup of Finite (Di)graphs | en |
dc.contributor.institution | School of Computer Science | |
dc.contributor.institution | Centre for Computer Science and Informatics Research | |
dc.contributor.institution | Adaptive Systems | |
dc.description.status | Peer reviewed | |
dc.date.embargoedUntil | 2018-09-26 | |
dc.identifier.url | https://arxiv.org/abs/1705.09577 | |
dc.identifier.url | http://www.worldscientific.com/doi/pdfplus/10.1142/S0218196717500412 | |
rioxxterms.versionofrecord | 10.1142/S0218196717500412 | |
rioxxterms.type | Journal Article/Review | |
herts.preservation.rarelyaccessed | true | |