Horváth, Gábor and Nehaniv, Chrystopher L. and Podoski, Károly (2017) The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs. INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 27 (7). pp. 863-886. ISSN 0218-1967
|
Text
1705.09577v2.pdf Download (336kB) | Preview |
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Rhodes's conjecture; Permutation Groups; Krohn-Rhodes complexity; invariants for digraphs; flow semigroup of digraphs; complete invariants for graphs |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 12 Feb 2018 02:42 |
| Last Modified: | 12 Feb 2018 02:42 |
| URI: | http://real.mtak.hu/id/eprint/74252 |
Actions (login required)
 |
Edit Item |
