
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
ChienYi Li, YueLi Wang, ShyueMing Tang, "Generalized Recursive Circulant Graphs," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 1, pp. 8793, January, 2012.  
BibTex  x  
@article{ 10.1109/TPDS.2011.109, author = { ChienYi Li and YueLi Wang and ShyueMing Tang}, title = {Generalized Recursive Circulant Graphs}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {23}, number = {1}, issn = {10459219}, year = {2012}, pages = {8793}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.109}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Generalized Recursive Circulant Graphs IS  1 SN  10459219 SP87 EP93 EPD  8793 A1  ChienYi Li, A1  YueLi Wang, A1  ShyueMing Tang, PY  2012 KW  graph theory KW  routing algorithm KW  generalized recursive circulant graph KW  network properties KW  graph class KW  multidimensional vertex labeling scheme KW  shortest path routing KW  Routing KW  Labeling KW  Indexes KW  Electronic mail KW  Cities and towns KW  Transforms KW  Hypercubes KW  bipartite graphs. KW  Circulant graphs KW  recursive circulant graphs KW  generalized recursive circulant graphs KW  shortest path KW  routing algorithms KW  diameter VL  23 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] S.B. Akers and B. Krishnamurthy, “A GroupTheoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555566, Apr. 1989.
[2] B. Alspach, S. Locke, and D. Witte, “The Hamilton Spaces of Cayley Graphs on Abelian Groups,” Discrete Math., vol. 82, pp. 113126, 1990.
[3] T. Araki, “EdgePancyclicity of Recursive Circulants,” Information Processing Letters, vol. 88, pp. 287292, 2003.
[4] J.C. Bermond, F. Comellas, and D.F. Hsu, “Distributed Loop Computer Networks: A Survey,” J. Parallel and Distributed Computing, vol. 24, pp. 210, 1995.
[5] N. Biggs, Algebraic Graph Theory, second ed. Cambridge Univ. Press, 1993.
[6] D.K. Biss, “Hamiltonian Decomposition of Recursive Circulant Graphs,” Discrete Math., vol. 214, pp. 8999, 2000.
[7] F. Boesch and A. Felzer, “A General Class of Invulnerable Graphs,” Networks, vol. 2, pp. 261283, 1972.
[8] F.T. Boesch and R. Tindell, “Circulants and Their Connectivities,” J. Graph Theory, vol. 8, pp. 487499, 1984.
[9] Z.R. Bogdanowicz, “Pancyclicity of Connected Circulant Graphs,” J. Graph Theory, vol. 22, pp. 167174, 1996.
[10] F. Buckley and F. Harary, Distance in Graphs, pp. 7375. AddisonWesley, 1990.
[11] I. Chung, “Construction of a Parallel and Shortest Routing Algorithm on Recursive Circulant Networks,” Proc. Fourth Int'l Conf. High Performance Computing in the AsiaPacific Region, pp. 580585, 2000.
[12] B. Elspas and J. Turner, “Graphs with Circulant Adjacency Matrices,” J. Combinatorial Theory, vol. 9, pp. 297307, 1970.
[13] C. Kim, J. Choi, and H.S. Lim, “Embedding Full Ternary Trees into Recursive Circulants,” Proc. First EurAsian Conf. Information and Comm. Technology, pp. 874882, 2002.
[14] F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. M. Kaufmann, 1992.
[15] H.S. Lim, J.H. Park, and K.Y. Chwa, “Embedding Trees in Recursive Circulants,” Discrete Applied Math., vol. 69, pp. 8399, 1996.
[16] B. Mans, “Optimal Distributed Algorithms in Unlabeled Tori and Chordal Rings,” J. Parallel and Distributed Computing, vol. 46, pp. 8090, 1997.
[17] C. Micheneau, “Disjoint Hamiltonian Cycles in Recursive Circulant Graphs,” Information Processing Letters, vol. 61, pp. 259264, 1997.
[18] M. Muzychuk, M. Klin, and R. Pöschel, “The Isomorphism Problem for Circulant Graphs via Schur Ring Theory. DIMACS Ser.,” Discrete Math. and Theoretical Computer Science, vol. 56, pp. 241264, 2001.
[19] J.H. Park and K.Y. Chwa, “Recursive Circulant: A New Topology for Multicomputer Networks,” Proc. Int'l Symp. Parallel Architectures, Algorithms and Networks (ISPAN '94), pp. 7380, 1994.
[20] J.H. Park and K.Y. Chwa, “Recursive Circulants and Their Embeddings among Hypercubes,” Theoretical Computer Science, vol. 244, pp. 3562, 2000.
[21] J.H. Park, “Strong Hamiltonicity of Recursive Circulants,” J. Korean Information Science Soc., vol. 28, pp. 742744, 2001.
[22] I. Stojmenović, “Multiplicative Circulant Networks: Topological Properties and Communication Algorithms,” Discrete Applied Math., vol. 77, pp. 281305, 1997.
[23] C.H. Tsai, J.J.M. Tan, Y.C. Chuang, and L.H. Hsu, “Hamiltonian Properties of Faulty Recursive Circulant Graphs,” J. Interconnection Networks, vol. 3, pp. 273289, 2002.
[24] C.H. Tsai, J.J.M. Tan, and L.H. Hsu, “The SuperConnected Property of Recursive Circulant Graphs,” Information Processing Letters, vol. 91, pp. 293298, 2004.
[25] J.S. Yang, J.M. Chang, S.M. Tang, and Y.L. Wang, “On the Independent Spanning Trees of Recursive Circulant Graphs $G(cd^m, d)$ with $d > 2$ ,” Theoretical Computer Science, vol. 410, pp. 20012010, 2009.
[26] J.S. Yang, J.M. Chang, S.M. Tang, and Y.L. Wang, “Constructing Multiple Independent Spanning Trees on Recursive Circulant Graphs $G(2^m, 2)$ ,” Int'l J. Foundations of Computer Science, vol. 21, pp. 7390, 2010.