Key points are not available for this paper at this time.
An integral circulant graph is a circulant graph whose adjacency matrix has only integer eigenvalues. It was conjectured by W. So that there are exactly 2^ (n) - 1 non-isospectral integral circulant graphs of order n, where (n) is the number of divisors of n. However, the conjecture remains unproven. In this paper, we present the fundamental concepts and results on the conjecture. We obtain the relation between two characterizations of integral circulant graphs given by W. So and by W. Klotz and T. Sander. Finally, we calculate the eigenvalues of the integral circulant graph G if S (G) = G₍ (d) for any d D. Here G₍ (d) is the set of all integers less than n that have the same greatest common divisor d with n.
Altınışık et al. (Fri,) studied this question.