DocumentCode
1415211
Title
Alternative shortest paths in n-cubes
Author
Narraway, J.J.
Author_Institution
Dept. of Electr. & Comput. Eng., New Brunswick Univ., Fredericton, NB, Canada
Volume
36
Issue
23
fYear
2000
fDate
11/9/2000 12:00:00 AM
Firstpage
1916
Lastpage
1918
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;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:20001383
Filename
888653
Link To Document