Edge-pancyclicity of recursive circulants
A graph is pancyclic if it has a cycle of length l for every 3 less than or equal to l less than or equal to \V\, and it is called edge-pancyclic if every edge lies on a cycle of length l for all l = 3, 4,..., \V\. We have shown in [Inform. Process. Lett. 81 (2002) 187-190] that the recursive circulants are pancyclic or nearly pancyclic. In this paper, we improve this result by showing that the recursive circulants are edge-pancyclic or nearly edge-pancyclic. (C) 2003 Elsevier B.V. All rights reserved.
edge-pancyclic pancyclic cycle recursive circulants interconnection networks