Quasi-abelian Cayley graphs and Parsons graphs (Q1363004)

Let \(G\) be a finite group and \(S\) a subset of \(G\) with \(1\notin S\) and \(S^{-1}= S\). A Cayley graph \(X= \text{Cay}(G,S)\) is called quasi-abelian, if \(S\) is the union of conjugacy classes of \(G\). The authors prove the following theorems: Theorem 1. Let \(G\) be a perfect group which is a central extension by a non-abelian simple group. If \(X=\text{Cay}(G,S)\) is a quasi-abelian Cayley graph, where \(S\) contains a non-central conjugacy class of \(G\), then \(X\) is connected. Theorem 2. Every connected quasi-abelian Cayley graph \(X=\text{Cay}(G,S)\) on a finite group \(G\) with \(|G|>2\) is Hamiltonian. As a corollary, the validity of three conjectures on Parsons graphs (with one exceptional example) posed by J. Zaks is implied.