Embedding of Circulant Networks into Wheels

Circulant graphs have been studied over many years because of its vast applications in telecommunication industry. We find the minimum wirelengths of embedding the circulant graph G(n; ±{1, 2}) and G(n; ±{1, 2, ..., j}) into variation of wheel graphs on n vertices in this paper.

Saved in:
Bibliographic Details
Published inIOP conference series. Materials Science and Engineering Vol. 1012; no. 1; pp. 12065 - 12070
Main Authors Mary, Stalin, Rajasingh, Indra
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 01.01.2021
Subjects
Apexes
Circulant graph
Congestion
Embedding
Graphs
Wheel graph
Online AccessGet full text

Cover

More Information
Summary:Circulant graphs have been studied over many years because of its vast applications in telecommunication industry. We find the minimum wirelengths of embedding the circulant graph G(n; ±{1, 2}) and G(n; ±{1, 2, ..., j}) into variation of wheel graphs on n vertices in this paper.
ISSN:1757-8981
1757-899X
DOI:10.1088/1757-899X/1012/1/012065