The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs (Q4596405)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6814640
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs |
scientific article; zbMATH DE number 6814640 |
Statements
The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs (English)
0 references
1 December 2017
0 references
Rhodes's conjecture
0 references
flow semigroup of digraphs
0 references
Krohn-Rhodes complexity
0 references
complete invariants for graphs
0 references
invariants for digraphs
0 references
permutation groups
0 references
0.7340077757835388
0 references
0.7340075969696045
0 references
0.7272840738296509
0 references
0.7263444066047668
0 references
