On the number of edges in a graph with many two-hop disjoint paths (Q2192123)
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: On the number of edges in a graph with many two-hop disjoint paths |
scientific article; zbMATH DE number 7215515
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of edges in a graph with many two-hop disjoint paths |
scientific article; zbMATH DE number 7215515 |
Statements
On the number of edges in a graph with many two-hop disjoint paths (English)
0 references
29 June 2020
0 references
connectivity
0 references
diameter
0 references
disjoint paths
0 references
2-hop path
0 references
0 references
0 references
0 references
0.7569513320922852
0 references
0.7543893456459045
0 references
0.748405933380127
0 references
0.7438037991523743
0 references
