Wide Diameter of Cayley Digraphs of Finite Cyclic Groups

I
ISPAN
2008
The International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)
Abstract - Wide Diameter of Cayley Digraphs of Finite Cyclic Groups

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Xingde Jia

The International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)

May 07-May 09

ISBN: 978-0-7695-3125-0

	ASCII Text	x
	Xingde Jia, "Wide Diameter of Cayley Digraphs of Finite Cyclic Groups," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 146-150, The International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008), 2008.

	BibTex	x
	@article{ 10.1109/I-SPAN.2008.19, author = {Xingde Jia}, title = {Wide Diameter of Cayley Digraphs of Finite Cyclic Groups}, journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on}, volume = {0}, year = {2008}, isbn = {978-0-7695-3125-0}, pages = {146-150}, doi = {http://doi.ieeecomputersociety.org/10.1109/I-SPAN.2008.19}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel Architectures, Algorithms, and Networks, International Symposium on TI - Wide Diameter of Cayley Digraphs of Finite Cyclic Groups SN - 978-0-7695-3125-0 SP146 EP150 A1 - Xingde Jia, PY - 2008 KW - Cayley digraphs KW - communication networks KW - wide diameter KW - geometric representation VL - 0 JA - Parallel Architectures, Algorithms, and Networks, International Symposium on ER -

Xingde Jia

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/I-SPAN.2008.19

According to recent studies, communication networks built on extremal Cayley digraphs of finite cyclic groups have many advantages over that based on n-cubes. Extremal Cayley digraphs have been studied extensively in recent years. In this paper, we prove, for every positive integer k, that the k-wide diameter of the Cayley diagraph Cay(Zm,A) is at most diam(Cay(Zm,A)) + 1 if A is an "m-ideal" set of k positive integers.

Index Terms:

Cayley digraphs, communication networks, wide diameter, geometric representation

Citation:

Xingde Jia, "Wide Diameter of Cayley Digraphs of Finite Cyclic Groups," ispan, pp.146-150, The International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008), 2008

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.