An isomorphism theorem for digraphs (Q3001204)
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 5901725
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An isomorphism theorem for digraphs |
scientific article; zbMATH DE number 5901725 |
Statements
31 May 2011
0 references
digraphs without loops
0 references
0.8293415904045105
0 references
0.8106141686439514
0 references
0.7711602449417114
0 references
0.750443160533905
0 references
0.7477530241012573
0 references
