Cycle Embedding in Generalized Recursive Circulant Graphs

Abstract

Generalized recursive circulant graphs (GRCGs for short) are a generalization of recursive circulant graphs and provide a new type of topology for interconnection networks. A graph of n vertices is said to be s-pancyclic for some 3 s n if it contains cycles of every length t for s t n. The pancyclicity of recursive circulant graphs was investigated by Araki and Shibata (Inf.