Characterisation of all integral circulant graphs with multiplicative divisor sets and few eigenvalues

We present a method which in principal allows to characterise all integral circulant graphs with multiplicative divisor set having a spectrum, i.e. the set of distinct eigenvalues, of any given size. We shall exemplify the method for spectra of up to four eigenvalues, also reproving some known results for three eigenvalues along the way. In particular we show that given any integral circulant graph of arbitrary order n with multiplicative divisor set and precisely four distinct eigenvalues, n necessarily is either a prime power or the product of two prime powers with explicitly given simply structured divisor set and set of eigenvalues in both cases.


Introduction
The adjacency matrix of an undirected graph G on n vertices is a real symmetric (n×n)matrix and thus has n real eigenvalues λ 1 , λ 2 , . . ., λ n , say, which are not necessarily distinct.In other words, G has real spectrum Spec(G) := {λ i : 1 ≤ i ≤ n}.Graphs with a small number of distinct eigenvalues, i.e. |Spec(G)| is small, have attracted quite a bit of attention over the past decades."Graphs with few distinct eigenvalues tend to have some kind of regularity", Brouwer and Haemers formulated in [7,Chapter 15] (also explaining the following statements).A graph with only one eigenvalue has no edges, and a graph with only two distinct eigenvalues is complete or, in general, a union of complete subgraphs.Generally, graphs with three eigenvalues need not be regular any more.However, for a connected regular graph we have the following classic result by Shrikhande and Bhagwandas: Theorem 1.1 [24] A regular connected graph has precisely three distinct eigenvalues if and only if it is strongly regular.
To this end, a graph G is called strongly regular with parameters (n, k, a, c) if G is k-regular with n vertices, neither complete nor empty, and every pair of adjacent (resp.non-adjacent) vertices has exactly a (resp.c) common neighbours.This notion was originally introduced by Bose [4] in 1963.Note that unconnected strongly regular graphs are characterised by c = 0 (equivalently a = k − 1) and are isomorphic to m copies of K k+1 for some m > 1 (cf.[12,Lemma 10.1.1]),resulting in m times eigenvalue k and mk times eigenvalue −1.Hence the structure of such graphs is fully understood.
Strongly regular graphs have been characterised in various ways.For example, in [18] the authors give a characterisation of strongly regular graphs by virtue of Euclidean representations of a graph.In contrast, the authors of [10] present an upper bound for the largest eigenvalue of the so-called signless Laplacian matrix of a given graph G.That bound is attained if and only if G is strongly regular, hence giving rise to a characterisation of strongly regular graphs.Graphs with few eigenvalues have also been considered with respect to eigenvalues associated with still other matrices, e.g. the normalized Laplacian matrix [5,14,28].
Van Dam and Omidi [29] generalize strongly regular graphs by introducing the notion of strongly walk-regular graphs.They characterise strongly walk-regular graphs by showing that this class consists of the following subclasses: empty graphs, complete graphs, strongly regular graphs, disjoint unions of complete bipartite graphs of the same size and isolated vertices, regular graphs with four eigenvalues.
Turning to various classes of connected regular graphs, it is of interest how to achieve a structural characterisation of the strongly regulars members of such a class (as opposed to the obvious algebraic characterisation by means of their spectrum).Considering the class of circulant graphs (i.e.graphs whose adjacency matrix is a circulant matrix), it has been shown in [6] that Paley graphs are the only non-trivial circulant strongly regular graphs-the "trivial" case being a complete multipartite graph or its complement.Let us now further restrict the graph class to those members whose eigenvalues are integers only.This yields the class of integral circulant graphs, cf.Sect. 2 for more details.As the authors of [27] point out, the Paley graphs in question must have p vertices, where p is a prime congruent 1 modulo 4, hence they are not integral.Thus, a characterisation of strongly regular integral circulant graphs can be achieved (see also [2,Theorem 15]).
The question whether connected graphs with four distinct eigenvalues exhibit any noticeable regularity features or how to characterise them is an active field of research.Some references can be found in [7, Chapter 15].Most notably, authors restrict themselves to particular graphs only.For example, the authors of [30] identify all regular connected graphs with four distinct eigenvalues having at most 30 vertices.In [13] it is proven that connected graphs with four distinct eigenvalues but at least three eigenvalues of multiplicity one cannot exist.Moreover, all connected regular graphs with four distinct eigenvalues and second least eigenvalue greater than or equal to 1 are determined.The paper [11] contains characterisations of grid graphs as co-edge-regular graphs with four distinct eigenvalues.
When it comes to integral circulant graphs with four distinct eigenvalues, results are still scarce.The authors of [26] identify several classes of connected integral circulant graphs with four distinct eigenvalues.It is our purpose to address the "small" spectrum problem for integral circulant graphs which have a multiplicative divisor set (see Sect. 2 and the introduction to Sect. 4 for definitions).We shall establish a method which in principal allows to identify all such graphs having a spectrum of any given size.For this purpose, we introduce the combinatorial concept of the gap number in Sect. 3 and show in Theorem 3.1 that the number of distinct eigenvalues of an integral circulant graph of prime power order is roughly twice the corresponding gap number.The multiplicativity property of the divisor sets enables us to decipher the structure of these sets-i.e.their so-called factorisation pattern (cf.Section 4)-explicitly for any integral circulant graph of arbitrary order n as long as it has a small spectrum (Theorems 5.1 and 7.1 for three or four distinct eigenvalues, respectively).
In particular, we shall exemplify our method for spectra of up to four eigenvalues, also reproving some known results for three eigenvalues along the way (see Sects. 5 and 6).Incidentally this will reveal the combinatorial difficulties one has to face in case of larger spectra.Nevertheless we completely unravel the mystery for integral circulant graphs of order n with multiplicative divisor set and precisely four distinct eigenvalues by showing that for any such graph n necessarily is either a prime power or the product of two prime powers with explicitly given simply structured divisor set and set of eigenvalues in both cases (Corollary 7.1).
We hope that the new approach inspires further research in this field and formulate a couple of open problems in Sect.8.

Basics about integral circulant graphs
Given a finite group -assuming the operation to be written additively with identity 0-and a generating set S ⊆ , the corresponding Cayley graph Cay( , S) is defined to have vertex set and edge set {{a, b} ∈ : a−b ∈ S}.If S = −S := {−s : s ∈ S} and 0 / ∈ S, then Cay( , S) is undirected and loop-free (cf.[12] for basic definitions and properties).
Let Z n := Z/nZ be the residue class group mod n, which we regularly identify with the set {0, 1, 2, . . ., n − 1} of non-negative residues.Circulant graphs are Cayley graphs on finite cyclic groups, i.e.
= Z n for some positive integer n, and we define Circ(n, S) := Cay(Z n , S).In this situation S is the set of neighbours of 0. For S = Z * n = {a ∈ Z n : gcd(a, n) = 1} being the set of all units in the residue class ring mod n, we obtain as a special case the so-called unitary Cayley graph Circ(n, Z * n ).Each circulant graph has a circulant adjacency matrix, whose j-th entry in the first row is 1 if j ∈ S and equals 0 otherwise (0 ≤ j ≤ n − 1), where the first entry is assumed to be zero in order to avoid loops in the graph.Each of the eigenvalues of a circulant matrix can explicitly be evaluated as a sum of roots of unity (see [9] for the general theory of circulant matrices).
A graph is called integral if all of its eigenvalues, i.e. the eigenvalues of the graph's adjacency matrix, are rational integers.In this case the sums of roots of unity computing the eigenvalues turn out to be sums of Ramanujan sums (cf.(3) or [15]), which explains the integrality of the eigenvalues.Using this observation, So [25] and Klotz and Sander [15] showed that a circulant graph Circ(n, S) is integral if and only if we have for some non-empty set In other words, each integral circulant graph Circ(n, S) is characterised by n and a non-empty set D ⊆ D(n) in such a way that it has vertex set Z n and edge set The notation ICG(n, D) Two arithmetic properties of D reflected by graph-theoretical features of ICG(n, D) are: 1.If n ∈ D, then apparently ICG(n, D) has loops, which is the reason why some authors preclude this possibility.However, we tolerate that n ∈ D, in particular for prime powers n, unless otherwise stated.2. ICG(n, D) is connected if and only if the elements of D are coprime (cf.[3, Proposition 1]).
Let ICG(n, D) be an integral circulant graph with an arbitrary positive integer n and a divisor set D ⊆ D(n).As shown in [15,Theorem 16], the eigenvalues of (the adjacency matrix of) ICG(n, D), taking multiplicities into account, are integers given by The chararacterisation of the set of edges in (2) reveals that integral circulant graphs are clearly regular.Actually, circulant adjacency matrices represent regular graphs, because the number of entries 1 in each row is trivially the same, hence all circulant graphs are regular.Therefore |S| (cf.(1)), counting the neighbours of 0, equals the degree of regularity of ICG(n, D)).It is well known that the degree of regularity of a regular graph is also its largest eigenvalue, its its multiplicity being the number of components of the graph (cf.[8]).It can easily be seen by ( 3) and (1) that λ n (n, D) plays this role in ICG(n, D)): , where ϕ(n) denotes Euler's totient function.

Spec(ICG(D, p k )) and gaps in the exponent set
The knowledge about the spectral vectors λ( p k , D) of integral circulant graphs ICG( p k , D) having prime power order p k is very satisfying (cf.[20][21][22]).A different task is to figure out the cardinality of the spectrum, i.e. the number of distinct eigenvalues.For its own sake as well as for later use we prove a formula for |Spec(ICG( p k , D))|, given any prime power order p k and allowing for p k ∈ D. Moreover we explicitly determine all ICG( p k , D) whose spectrum contains at most four distinct eigenvalues.
Let p k be a prime power.Given a divisor set D ⊆ D( p k ), i.e.D = {p k 1 , . . ., of D. The results of the following proposition, all of them well known, will be used to prove Theorem 3.1 below.
satisfying the following conditions: The gap number γ (p k , D) is defined as the number of gaps in K D .By looking at exponent sets with gaps The main result of the subsequent theorem is that σ ( p k , D) roughly equals 2 • γ (p k , D).

Theorem 3.1 Let p k be a prime power, and let
(5) ) and a γ (p k ,D)+1 := k, the leaping set has the following characterisation in terms of the gaps: The spectrum of ICG( p k , D) is given by the (γ where λ 1 ( p k , D) was determined in Proposition 3.1(i).Notice that sums with an empty range of summation are to be understood as 0 and sets with unaccomplishable conditions equal ∅.
Proof The characterisation (5) of the exponent set in terms of the gaps is a straightforward consequence of the definition of the gaps, depending only on whether Observe that the definition of G 0 takes care of a possible initial "gap" in K D , i.e. if 0 / ∈ K D .According to Proposition 3.1(iv) the distinct eigenvalues in Spec(ICG( p k , D)) are characterised by the pairs In our setting, these are The latter reduction of the range of eligible pairs results from the fact that the pair Taking account of all suitable pairs and-according to definition (4 , we obtain the leaping set which confirms (6).Consequently Proposition 3.1(iv) implies which verifies (i).Up to this point (i), ( 5) and ( 6) have been confirmed, and it remains to show (7).Let us start with the special cases σ ( p k , D) = |L D | ∈ {1, 2}, i.e. the situation where K D has no gap according to (i). For Since K D has no gaps, we necessarily have which completes the verification of (7) for σ ( p k , D) = 2.
Therefore, we may assume that σ ( p k , D) ≥ 3, whence γ (p k , D) ≥ 1 according to (i), and thus b 0 < k.Without loss of generality we may assume that the gaps G i in K D are indexed in such a way that (6) and Proposition 3.1(iv), and abbreviating λ p j := λ p j ( p k , D), this implies that , arranged according to increasing indices, i.e. increasing exponents of p.
Let λ p k− , λ p k− with < be any pair of successive eigenvalues in (8).According to Proposition 3.1(iii) we have By using these identities inductively, collection (8) can be written as This, finally, proves (7) and completes the proof of the theorem.
The following result exemplifies the use of Theorem 3.1 in order to determine all ICG( p k , D) satisfying σ ( p k , D) = s for any given s.  1.
Proof All entries for σ ( p k , D) = 1 and σ ( p k , D) = 2 in Table 1 have explicitly been discussed in the proof of (7) of Theorem 3.1, and the required values of λ 1 ( p k , D) can be found in Proposition 3.1(i).It remains to check the cases σ ( p k , D) ≥ 3.
First of all we observe that k ∈ K D versus k / ∈ K D has an effect on the value of λ 1 ( p k , D) (cf.Proposition 3.1(i)) and consequently on all eigenvalues (see (7)), but does not influence the leaping set L D (cf. its definition in (4)) nor the set of  (5).The corresponding sets L D and Spec(ICG( p k , D)), as given in Table 1, follow from ( 6) and (7), respectively. For Then L D and Spec(ICG( p k , D)) can again be determined by ( 6) and (7), respectively.

ICG(n, D) with multiplicative D and its spectrum
All integral circulant graphs considered in the preceding section had prime power order.Contrary to the spectral vectors of such graphs, λ(n, D) for arbitrary composite n is not well understood.Therefore the idea to consider integral circulant graphs ICG(n, D) with arbitrary n, but multiplicative divisor sets D was introduced and applied by Le and the first author in [16,17], and again used by the first author in [19].
We continue with a useful observation, namely a kind of monotonicity property of the function σ (n, D) with respect to the number ω(n) of distinct prime factors of n.
Proof The assertion in (ii) is an immediate corollary to (i).In order to verify (i), let λ 1 , . . ., λ σ be the σ : We shall say that a divisor set D ⊆ D( p k ) for a prime power p k is of type X ∈ {A, B1, B2, C1, C2, D1, D2} if it has the corresponding form in Table 1 for the coinciding values of minimum and maximum.This is the case when σ ( e. it depends only on the types X 1 , X 2 , . . ., X r , but does not depend on the special values of p i or k i or any of the other parameters involved.Trivially, the order of the X i in a factorisation pattern The following proposition analyses the sizes of spectra of integral circulant graphs whose multiplicative divisor sets have factorisation patterns composed of divisor sets of the types occurring in Table 1.Proposition 4.2 Given any positive integer r , let p 1 , p 2 , . . ., p r be distinct primes and let k 1 , k 2 , . . ., k r be positive integers.For each i ∈ [1 • • • r ] and X i ∈ {A, B1, B2, C1, C2, D1, D2} let D i ⊆ D( p k i i ) be a divisor set of type X i .For any positive integer m and X ∈ {A, B1, B2} let as given in Table 2 by Proposition 4.1.In particular the order of the D i does not influence the sets D or Spec(ICG(n, D)).Consequently, σ X 1 •X 2 •...•X r and, if defined, σ X 1 •X 2 •...•X r are unaffected by the order of the X i .(i) Let D i ⊆ D( p k i i ), r + 1 ≤ i ≤ r + m, be m further divisor sets all of type A, i.e.Spec(ICG( p k i i , D i )) = {1} for r + 1 ≤ i ≤ r + m according to Corollary 3.1.It follows by (10) that Spec(ICG( Moreover, (10) and and this set always contains two distinct positive and two distinct negative entries by the fact that p 1 and p 2 are distinct primes and Furthermore, by ( 10) This set apparently contains the four distinct elements of (−1) (11)) and additionally the integer3 i=1 ( p k i −u i i −1), being bigger than any of the former four integers.This shows that σ B1 3 ≥ 5.
Assume alternatively that D 3 ⊆ D( p k 3 3 ) is a divisor sets of type B2, i.e.Spec(ICG( Finally it is an easy consequence of Corollary 3.1 and (10) that Spec(ICG( which are all of type B2.This confirms that σ B2 m = 2.
(iii) Let us show in an exemplary way that σ B1•C2 ≥ 5. To this end, let D 1 ⊆ D( p k 1 1 ) be of type B1, i.e.Spec(ICG( +1} for suitable 0 ≤ u 2 < v 2 < k 2 by Corollary 3.1.Using (10) we conclude that say.The second and third element of S 1 are easily seen to be different from −1.Moreover, By careful reasoning along the line of the argument used above one can easily fill Table 2 with the alleged entries.
(iv) By the observation already used in (ii) that Spec(ICG( type B1, it is easy to check the four formulae in (iv).

ICG(n, D) with multiplicative D and (n, D) ≤ 3
Applying the results quoted in the introduction to integral circulant graphs ICG(n, D) reveals that the cases σ (n, D) = 1 and σ (n, D) = 2 are trivial, and that in case of connectivity σ (n, D) = 3 characterises strongly regular graphs.Although the following result is essentially known (cf.commentary preceding Corollary 5.1) we use it to illustrate our method.We agree to define empty products of integers as 1 and empty products of sets to be {1}.
Given the prime factorisation n = p k 1 1 • . . .• p k r r (indexed in suitable order), Table 3 provides the corresponding parameterised forms of D and the associated spectra Spec(ICG(n, D)).

Proof
The formulae for the divisor sets D and the spectra Spec(ICG(n, D)) corresponding to the factorisation patterns in the four cases (cf.Table 3) are immediately obtained by use of Table 1 in Corollary 3.1.Therefore it suffices to prove that σ (n, D) = 3 if and only if the multiplicative divisor set D has one of the three factorisation patterns in Table 3.Let us denote by α(n, D), our assertion is a special case of Theorem 5.1.Since 1 lies in every D i , we cannot have any set D i = {p k i i } of type A, i.e. α(n, D) = 0.For the first pattern in Table 3 p k is a prime power and p k ∈ D, contradicting our assumptions.
We are left with the second or third pattern in Table 3, where α(n, D) = 0 yields m = r −1, therefore B2 r −1 •C1 for some r ≥ 1 or B1•B2 r −1 for some r ≥ 2.Moreover, in both cases u i = 0 for 1 ≤ i ≤ r , because 1 lies in every D i .Consequently, the corresponding divisor sets look like with r ≥ 2. For p := p r and setting t := v r in the former case and t := k r = e p (n) in the latter case, we combine the two cases to obtain D = {d ∈ D(n) : p t d}, where 1 ≤ t ≤ e p (n) and r = ω(n) ≥ 2 in case t = e p (n).
It remains to determine the corresponding spectra.Observe that Spec(ICG(n, D)) for the third pattern in Table 3 equals the extension of the spectrum for the second pattern to the case v r = k r .Since u i = 0 for 1 ≤ i ≤ r , combining the cases yields   Proof According to [25,Theorem 7.1] we know that for p i = p and D i = D( p t−1 ) for p i = p.Setting s i = k i for p i = p and s i = t − 1 for p i = p, Lemma 6.1 implies S = {1, 2, 3, . . ., n − 1}\M n ( p t ).Now suppose conversely that S = {1, 2, 3, . . ., n − 1}\M n ( p t ) as specified above.For composite n, i.e. in case ω(n) ≥ 2, the strong regularity of Circ(n, S) as well as its parameters have been verified in [27,Theorem 4.1].It remains to consider prime powers n = p k , say.Clearly, the degree ρ of regularity of Circ(n, S) is ρ = |S| = n − n p t .Let λ denote the number of common neighbours of every two adjacent vertices of Circ(n, S), and let μ be the number of common neighbours of every two non-adjacent vertices.Since 1 ∈ D, the vertices 0 and 1 are adjacent in Circ(n, S), and clearly their common neighbours are all 1, 2, . . ., n − 1 except for the vertices of type ).Our Theorem 6.2 verifies this result for the subclass of integral circulant graphs with multiplicative divisor sets and shows, however, that admissable divisors d in M n (d) for our subclass necessarily have to be prime power divisors p t of n (see Corollary 6.2).Lemma 6.1 reveals that this special arithmetic feature of possible "exceptional" d, namely that d cannot be a composite divisor, is a consequence of two facts, which are (i) 1 ∈ D, in other words enforced by the connectedness of Circ(n, S), and (ii) s i = k i for all but one index i.

ICG(n, D) with multiplicative D and (n, D) = 4
As already mentioned in the introduction, achieving a characterisation of integral circulant graphs with exactly four distinct eigenvalues is currently an open and elusive research goal.Hence it is useful to focus on subclasses first.The following theorem provides a complete list of factorisation patterns of multiplicative divisor sets D with σ (n, D) = 4. Observe that the primes dividing n are completely irrelevant for our result.Even the arithmetic nature of n, e.g. the number ω(n) of prime factors or the order of primes in n is negligible.All that is required for some factorisation patterns to occur is ω(n) ≥ 2 and that some prime factor of n has a certain minimal order of 2 or 3 in n.
(indexed in suitable order), Table 4 provides the corresponding parameterised forms of D and the associated spectra Spec(ICG(n, D)).
Proof The formulae for the divisor sets D and the spectra Spec(ICG(n, D)) corresponding to the factorisation patterns in the four cases (cf.      4. In analogy to the characterisation of strongly regular integral circulant graphs-i.e.those connected regular graphs with exactly three distinct eigenvalues-in Corollary 5.1 and Sect.6 we now consider integral circulant graphs with precisely four distinct eigenvalues, again imposing the graph-theoretical conditions that ICG(n, D) is connected, i.e. 1 ∈ D, and loopfree, i.e. n / ∈ D. These "natural" graph-theoretical conditions imply the strong arithmetic restriction that n may not have more than two distinct prime factors.
We are left with cases (iii) and (iv) of Theorem 7.1, where α(n, D) = 0 yields m = r −1, therefore π 4 (n, D) = (0, 0, r −1, 0, 0, 0, 1) for some r ≥ 1 or π 4 (n, D) = (0, 0, r − 1, 0, 1, 0, 0) for some r ≥ 2.Moreover, in both cases u i = 0 for 1 ≤ i ≤ r , because 1 lies in every D i .Consequently, the corresponding divisor sets are of shape the article's Creative Commons licence, unless indicated otherwise in a credit line to the material.If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.

Corollary 3 . 1
The values of γ (p k , D) and the leaping set L D , the exponent set K D and the spectrum Spec(ICG( p k , D)) corresponding to integral circulant graphs ICG( p k , D) with 1 ≤ σ ( p k , D) ≤ 4 are given in Table For a positive integer d and a number p in the set P of all primes, we denote by e p (d) the order of p in d.A non-empty finite set D of positive integers-as for instance a divisor set-is called multiplicative if D = p∈P D p , where D p := { p e p (d) : d ∈ D} for each prime p, and the product of sets D 1 , . . ., D t of positive integers is defined ast i=1 D i := {d 1 • . . .• d t : d i ∈ D i }.The following formula to determine Spec(ICG(n, D)) for multiplicative divisor sets D is a consequence of Proposition 3.1(iv).

Proposition 4 . 1
(= [21, Theorem 5.1(i)]) Let n > 1 be an integer with prime factorisation n = p k 1 1 • . . .• p k r r .For 1 ≤ i ≤ r let D i ⊆ D( p k i i) be a divisor set with leaping set L D i , and define the multiplicative divisor set D

Theorem 5 . 1
Let n > 1 be an integer with r := ω(n) distinct prime factors and let D ⊆ D(n) be a multiplicative divisor set.Then σ (n, D) = 3 if and only if D has 123 and consequently the divisor sets D i are of type A, B1, B2, C1, C2 by Corollary 3.1.

6 . 1
Corollary 5.1 by use of Theorem 1.1.By definition (cf.(1)) we have ICG(n, D) = Circ(n, S) for S = d∈D G n (d) and some divisor set D of n, where G n (d) = {1 ≤ a ≤ n − 1 : gcd(a, n) = d}.We prepare the translation of Theorem 6.1 into the terminology of Circ(n, S) by Lemma Let n > 1 have prime factorisation n = p k 1 1 • . . .• p k r r , and let

Table 1
All integral circulant graphs ICG( p k , D) with at most four distinct eigenvalues

Table 3
All factorisation patterns producing σ (n, D) = 3 The goal of this section is to rephrase the results from the previous section such that their connection to previously known results about strong regularity of integral circulant graphs from other sources (e.g.[27, Theorems 4.1 and 4.2]) becomes more transparent.To this end, Corollary 5.1 and Theorem 1.1 immediately imply the following characterisation, which has also been obtained in [2, Theorem 15] by use of different tools.Let n > 1 be an integer, and let ICG(n, D) be a connected (loopless) integral circulant graph with multiplicative D. Then ICG(n, D) is strongly regular if and only if D = {d ∈ D(n) : p t d} for some prime p | n, where 1 ≤ t ≤ e p (n) and ω(n) ≥ 2 in case t = e p (n). ∈ D i for all i, because otherwise some p i would divide all elements of D. Thus 1 ∈ D, and n / ∈ D since ICG(n, D) is loopless (cf.property 1 in Sect.2).Now all assertions follow from 2, 3, . . . .Let n > 1 be an integer and let Circ(n, S) be a loop-free connected integral circulant graph, i.e. S = d∈D G n (d) for some D ⊆ D(n) satisfying 1 ∈ D and n / ∈ D. Furthermore assume that D is multiplicative.Then Circ(n, S) is strongly regular if and only if S = {1, 2, 3, . . ., n − 1}\M n ( p t ) for some prime power divisor p t of n, where 1 ≤ t ≤ e p (n) and ω(n) ≥ 2 in case t = e p (n).First assuming that Circ(n, S) is strongly regular, Theorem 6.1 implies that D = {d ∈ D(n) : p t d} for some prime p | n, where 1 ≤ t ≤ e p (n) and ω j • p t and those of type j • p t + 1. Hence λ = n − 2 • n p t .Similarly 0 and p t are nonadjacent vertices and have as common neighbours all vertices 1, 2, . . ., n − 1 except for the vertices of type j • p t , thus μ = n − n p t .Altogether, we have the parameters (n, ρ, λ, μ) = n, n − n p t , n − 2n p t , n − n p t as required.Remark 6.1 A connected circulant graph Circ(n, S) with exactly three integral eigenvalues satisfies S = {1, 2, 3, . . ., n − 1}\M n (d) for some proper divisor d ∈ D(n)\{1, n} of n (cf.[27, Theorem 4.2]

Table 4 )
are immediately obtained by use of Table 1 in Corollary 3.1.Therefore it suffices to prove that σ (n, D) = 4 if and only if the multiplicative divisor set D has one of the four factorisation patterns in Table 4.By Lemma 4.1(ii), σ (n, D) ≤ 4 for n