On the set of all shortest paths of a given length in a connected graph (Q4396135)
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 1164610
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the set of all shortest paths of a given length in a connected graph |
scientific article; zbMATH DE number 1164610 |
Statements
2 December 1998
0 references
shortest path
0 references
connected graph
0 references
characterization
0 references
On the set of all shortest paths of a given length in a connected graph (English)
0 references
0.7796158790588379
0 references
0.7756947875022888
0 references
