Embedding of Circulant Networks into Wheels

Abstract

Abstract 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.