Cayley graphs of finite groups

From MaRDI portal





Cayley graphs \(\Gamma\) (G,T) of a finite group G defined by normal generating sets T (unions of conjugacy classes) are studied via irreducible complex characters. The author obtains a formula equating the eigenvalues of the Cayley graph to weighted sums of the character values at points over T. As a consequence, he provides a formula to compute the number of paths of length n connecting 1 to any vertex in G. Under the assumption that G possesses a cyclic subgroup of odd order, this number is an invariant for elements of the same order. The number is also invariant for adjacent elements of the Cayley graph under more restrictive conditions and a particular choice of generating set T.




Cited in
(43)








This page was built for publication: Cayley graphs of finite groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1115972)