Distinct Paths for the Star Graph

Authors

Xiaolong Wu, University of Nevada, Las VegasFollow
He Min, California State University
Fei Wang, California State University
Yang Jing, Chongqing University of Technology
Shahram Latifi, University of Nevada, Las VegasFollow

Document Type

Conference Proceeding

Publication Date

1-6-2009

Publication Title

WRI International Conference on Communications and Mobile Computing, CMC

Publisher

Institute of Electrical and Electronics Engineers

First page number:

322

Last page number:

326

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

Computer architecture; Computer science; Fault tolerance; Hypercubes; Measurement; Mobile communication; Mobile computing; Performance analysis; Topology; Tree graphs

Disciplines

Controls and Control Theory | Electrical and Computer Engineering | Electrical and Electronics | Systems and Communications

Language

English

Comments

Conference held: Yunnan, 6-8 Jan. 2009

Permissions

Use Find in Your Library, contact the author, or interlibrary loan to garner a copy of the item. Publisher policy does not allow archiving the final published version. If a post-print (author's peer-reviewed manuscript) is allowed and available, or publisher policy changes, the item will be deposited.

Repository Citation

Wu, X., Min, H., Wang, F., Jing, Y., Latifi, S. (2009). Distinct Paths for the Star Graph. WRI International Conference on Communications and Mobile Computing, CMC 322-326. Institute of Electrical and Electronics Engineers.