Digraphs that have at most one walk of a given length with the same endpoints (Q616364)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Digraphs that have at most one walk of a given length with the same endpoints |
scientific article; zbMATH DE number 5833945
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Digraphs that have at most one walk of a given length with the same endpoints |
scientific article; zbMATH DE number 5833945 |
Statements
Digraphs that have at most one walk of a given length with the same endpoints (English)
0 references
7 January 2011
0 references
digraph
0 references
walk
0 references
number of arcs
0 references
tournament
0 references
0 references
0.9034813
0 references
0.8906348
0 references
0.88097215
0 references
0.87929076
0 references
0.86749804
0 references
0.83664477
0 references
