Subscribe

Issue No.01 - January (2012 vol.23)

pp: 87-93

Shyue-Ming Tang , Fu Hsing Kang Sch., Nat. Defense Univ., Taipei, Taiwan

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.109

ABSTRACT

In this paper, we propose a new class of graphs called generalized recursive circulant graphs which is an extension of recursive circulant graphs. While retaining attractive properties of recursive circulant graphs, the new class of graphs achieve more flexibility in varying the number of vertices. Some network properties of recursive circulant graphs, like degree, connectivity and diameter, are adapted to the new graph class with more concise expression. In particular, we use a multidimensional vertex labeling scheme in generalized recursive circulant graphs. Based on the labeling scheme, a shortest path routing algorithm for the graph class is proposed. The correctness of the routing algorithm is also proved in this paper.

INDEX TERMS

graph theory, routing algorithm, generalized recursive circulant graph, network properties, graph class, multidimensional vertex labeling scheme, shortest path routing, Routing, Labeling, Indexes, Electronic mail, Cities and towns, Transforms, Hypercubes, bipartite graphs., Circulant graphs, recursive circulant graphs, generalized recursive circulant graphs, shortest path, routing algorithms, diameter

CITATION

Shyue-Ming Tang, "Generalized Recursive Circulant Graphs",

*IEEE Transactions on Parallel & Distributed Systems*, vol.23, no. 1, pp. 87-93, January 2012, doi:10.1109/TPDS.2011.109REFERENCES