Title :
Alternative shortest paths in n-cubes
Author_Institution :
Dept. of Electr. & Comput. Eng., New Brunswick Univ., Fredericton, NB, Canada
fDate :
11/9/2000 12:00:00 AM
Abstract :
Explicit expressions are given for the number of shortest paths between any two vertices in an n-cube, each path being otherwise vertex disjoint from any specified shortest path between the same pair of vertices, and for the probability of randomly selecting one of these alternative paths
Keywords :
graph theory; hypercube networks; probability; alternative shortest paths; n-cubes; probability; random selection; vertex disjoint;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:20001383
