Relations between connected and self-avoiding hikes in labelled complete digraphs (Q343737)
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 6657150
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Relations between connected and self-avoiding hikes in labelled complete digraphs |
scientific article; zbMATH DE number 6657150 |
Statements
Relations between connected and self-avoiding hikes in labelled complete digraphs (English)
0 references
29 November 2016
0 references
directed graph
0 references
walk
0 references
poset
0 references
weighted adjacency matrix
0 references
incidence algebra
0 references
0.7242408990859985
0 references
0.7057068943977356
0 references
0.705104410648346
0 references
0.7050989866256714
0 references
