Average hopcount of the shortest path in tree-like components with finite size (Q2154398)
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: Average hopcount of the shortest path in tree-like components with finite size |
scientific article; zbMATH DE number 7559858
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Average hopcount of the shortest path in tree-like components with finite size |
scientific article; zbMATH DE number 7559858 |
Statements
Average hopcount of the shortest path in tree-like components with finite size (English)
0 references
19 July 2022
0 references
random graph
0 references
average shortest path
0 references
finite component
0 references
configuration model
0 references
0 references
0.7519853115081787
0 references
0.7152717113494873
0 references
0.7142937183380127
0 references
0.7033305168151855
0 references
