An extended star graph: a proposal of a new network topology and its fundamental properties
by Satoru Watanabe, Satoshi Okawa
International Journal of Computational Science and Engineering (IJCSE), Vol. 2, No. 1/2, 2006

Abstract: In the past years, various network architectures for parallel computers have been proposed, for example, hyper cubes or star graphs. These classes of networks are known as Cayley graphs. In recent years, there have been some proposals of new families of interconnection networks, namely, constant degree networks. In this paper, a new interconnection network named extended star graphs is proposed, and it is proved that the extended star graphs have hypercube structure. We also provide a routing algorithm for node-to-node communication on extended star graphs. Based on the algorithm, we obtain an upper bound 2n−1 on the diameter for the n-th order extended star graph.

Online publication date: Sat, 03-Jun-2006

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com