Generalized Recursive Circulant Graphs

Abstract

In this paper, we propose a new class of graphs called generalized recursive circulant graphs (GRCGs for short). As it is named, GRCGs are a generalization of recursive circulant graphs. This generalization is achieved by using a multidimensional vertex labeling scheme. Various network metrics of GRCGs, such as degree, connectivity and hamiltonian properties are studied. A shortest path routing algorithm for GRCGs is also proposed in this paper.