Circulant digraphs determined by their spectra (Q5948984)

As usual, \(C_n(S)\) denotes the circulant directed graph with \(n\) vertices whose connection set is \(S\) \((\subset Z_n)\). We say that \(C_n(S)\) is spectrum-determined if there exists no circulant digraph \(C_n(T)\) such that \(C_n(S)\) and \(C_n(T)\) have the same spectrum and are not isomorphic. Let \(\varphi\) be the Euler function and \(D(S)\) be the difference of the maximal and minimal element of \(S\). It is verified that certain subclasses of the class of circulant digraphs consist solely of spectrum-determined digraphs. As a typical result, it is proved for the subclass \(K\) defined by the condition \(n= p^a q^b\) and \(D(S)< \varphi(n)\) (where \(p\) and \(q\) are distinct odd primes) that \(K\) possesses the property mentioned above. In addition, the reviewer's conjecture (about the isomorphy of circulant digraphs) is shown to hold in \(K\).