Gezer N. A.
Annals of Mathematics and Computer Science, vol.30, pp.41-53, 2025 (Peer-Reviewed Journal)
Abstract
This article investigates the properties of iterated line graphs derived from Cayley graphs of finitely generated groups. We study their graph-theoretical properties such as diameter and automorphism groups, and present recursive algorithms for their construction. We show that while these iterated graphs preserve certain algebraic properties, their size grows exponentially and their diameters grow linearly. A generalization of Whitney's theorem about the automorphism groups is presented.