.png){kind=icon}
Return
Path embedding in star graphs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2008.10.040.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The star graph interconnection network has been introduced as an attractive alternative to the hypercube network. In this paper, we consider the path embedding problem in star graphs. Assume that n >= 4. We prove that paths of all even lengths from d(x, y) to n! - 2 can be embedded between two arbitrary vertices x and y from the same partite set in the n-dimensional star graph. In addition, paths of all odd lengths from d(x, y) to n! - 1 can be embedded between two arbitrary vertices x and y from different partite sets in the n-dimensional star graph except that if x and y are adjacent, there is no path of length 3 between them. The result is optimal in the sense that paths of all possible lengths are found in star graphs. (C) 2008 Elsevier Inc. All rights reserved.
Keywords:
Path
Embedding
Star graph
Interconnection network
Hamiltonian
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSave
View more