A FEW FAMILIES OF CAYLEY GRAPHS AND THEIR EFFICIENCY AS COMMUNICATION NETWORKS (Q5269731)
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 6736177
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A FEW FAMILIES OF CAYLEY GRAPHS AND THEIR EFFICIENCY AS COMMUNICATION NETWORKS |
scientific article; zbMATH DE number 6736177 |
Statements
A FEW FAMILIES OF CAYLEY GRAPHS AND THEIR EFFICIENCY AS COMMUNICATION NETWORKS (English)
0 references
27 June 2017
0 references
Cayley graph
0 references
circulant graph
0 references
cube-connected cycle
0 references
interconnection network
0 references
routing
0 references
shortest path
0 references
diameter
0 references
Wiener index
0 references
edge-forwarding index
0 references
vertex-forwarding index
0 references
bisection width
0 references
0 references
