Title :
Distinct Paths for the Star Graph
Author :
Wu, Xiaolong ; He, Min ; Wang, Fei ; Yang, Jing ; Latifi, Shahram
Author_Institution :
Dept. of Comput. Eng. & Comput. Sci., California State Univ., Long Beach, CA
Abstract :
In this paper, we investigate the properties of cycles for node representation in the star graph. Cycles can be in any order. The position for each symbol in the ordinary cycle is fixed and the ordinary cycle can not be nested into any other cycle. However, cyclic shift operations on symbols in a none-ordinary cycle are allowed and none-ordinary cycle can be nested into any other cycle. The number of distinct paths for the star graph is determined using the combinatorial analysis.
Keywords :
graph theory; multiprocessor interconnection networks; network routing; combinatorial analysis; cyclic permutation; cyclic shift operation; distinct path; distinct symbol; node representation; star graph interconnection network routing; Computer architecture; Computer science; Fault tolerance; Hypercubes; Measurement; Mobile communication; Mobile computing; Performance analysis; Topology; Tree graphs;
Conference_Titel :
Communications and Mobile Computing, 2009. CMC '09. WRI International Conference on
Conference_Location :
Yunnan
Print_ISBN :
978-0-7695-3501-2
DOI :
10.1109/CMC.2009.294
