NDLI: Generalized Recursive Circulant Graphs

Content Provider	IEEE Xplore Digital Library
Author	Shyue-Ming Tang Yue-Li Wang Chien-Yi Li
Copyright Year	1990
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.
Sponsorship	IEEE Computer Society
Starting Page	87
Ending Page	93
Page Count	7
File Size	469029
File Format	PDF
ISSN	10459219
Volume Number	23
Issue Number	1
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-01-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	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
Content Type	Text
Resource Type	Article
Subject	Signal Processing Computational Theory and Mathematics Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Optimal Edge Congestion of Exchanged Hypercubes

Shortest Path Tree Computation in Dynamic Graphs

Optimizing graph algorithms for improved cache performance

Algorithms and bounds for shortest paths and diameter in faulty hypercubes

A shortest path routing algorithm for incomplete WK-recursive networks

A well-behaved enumeration of star graphs

Bused hypercubes and other pin-optimal networks

Edge congestion of shortest path systems for all-to-all communication

Orthogonal graphs for the construction of a class of interconnection networks

Generalized Recursive Circulant Graphs

Similar Documents

Optimal Edge Congestion of Exchanged Hypercubes

Shortest Path Tree Computation in Dynamic Graphs

Optimizing graph algorithms for improved cache performance

Algorithms and bounds for shortest paths and diameter in faulty hypercubes

A shortest path routing algorithm for incomplete WK-recursive networks

A well-behaved enumeration of star graphs

Bused hypercubes and other pin-optimal networks

Edge congestion of shortest path systems for all-to-all communication

Orthogonal graphs for the construction of a class of interconnection networks

Generalized Recursive Circulant Graphs