.png){kind=icon}
Return
Generalized Recursive Circulant Graphs
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2011.109.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Circulant graphs
recursive circulant graphs
generalized recursive circulant graphs
shortest path
routing algorithms
diameter
bipartite graphs
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
5.2K
Citations:
1.1W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
ShareSaveShareSaveShareSave
View more