Distance formula and shortest paths for the \((n,k)\)-star graphs (Q975861)
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: Distance formula and shortest paths for the (n,k)-star graphs |
scientific article; zbMATH DE number 5720196
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distance formula and shortest paths for the \((n,k)\)-star graphs |
scientific article; zbMATH DE number 5720196 |
Statements
Distance formula and shortest paths for the \((n,k)\)-star graphs (English)
0 references
11 June 2010
0 references
distance formula
0 references
shortest paths
0 references
(\(n,k\))-star graphs
0 references
path enumeration
0 references
0 references
0.8483821153640747
0 references
0.8194073438644409
0 references
0.7742194533348083
0 references
0.7739161252975464
0 references
0.7645959854125977
0 references
