×

Splitting fields of spectra of circulant graphs. (English) Zbl 1482.05203

Summary: Given a circulant graph \(\operatorname{Cay}( \mathbb{Z}_n, S)\), we precisely determine its splitting field and algebraic degree, i.e. the least algebraic extension \(K | \mathbb{Q}\) of the rationals, which contains all eigenvalues of \(\operatorname{Cay}( \mathbb{Z}_n, S)\), and its respective degree \([K : \mathbb{Q}]\). This generalizes a result of W. So [Discrete Math. 306, No. 1, 153–158 (2006; Zbl 1084.05045)] who classified all integral circulant graphs. We prove that there is a deep connection between Schur rings and the splitting field of circulant graphs, which are subfields of cyclotomic fields, and solve the inverse Galois problem for circulant graphs showing that every finite abelian extension of the rationals is the splitting field of some circulant graph. Moreover, we deduce some new necessary criteria for isospectrality of circulant graphs and give a graph-theoretical interpretation of the algebraic degree of circulant graphs: we prove that the algebraic degree of a circulant graph is determined by its automorphism group.

MSC:

05C50 Graphs and linear algebra (matrices, eigenvalues, etc.)
05C25 Graphs and abstract algebra (groups, rings, fields, etc.)

Citations:

Zbl 1084.05045
Full Text: DOI

References:

[1] Bridges, W. G.; Mena, R. A., Rational circulants with rational spectra and cyclic strongly regular graphs, Ars Comb., 8, 143-161 (1979) · Zbl 0443.05046
[2] Bridges, W. G.; Mena, R. A., Rational g-matrices with rational eigenvalues, J. Comb. Theory, Ser. A, 32, 264-280 (1982) · Zbl 0485.05040
[3] Brown, J., Isomorphic and nonisomorphic, isospectral circulant graphs (2009), Preprint
[4] Harary, F.; Schwenk, A. J., Which Graphs Have Integral Spectra?, 45-51 (1974), Springer Berlin Heidelberg: Springer Berlin Heidelberg Berlin, Heidelberg
[5] Klin, M.; Kovács, I., Automorphism groups of rational circulant graphs, Electron. J. Comb., Article P35 pp. (2012) · Zbl 1244.05234
[6] Klin, M. H.; Pöschel, R., The König problem, the isomorphism problem for cyclic graphs and the characterization of Schur rings, (Algebraic Methods in Graph Theory. Algebraic Methods in Graph Theory, Szeged (Hungary). Algebraic Methods in Graph Theory. Algebraic Methods in Graph Theory, Szeged (Hungary), Colloquia Mathematica Societatis János Bolyai, vol. 25 (1978)) · Zbl 0416.05044
[7] Mans, B.; Pappalardi, F.; Shparlinski, I. E., On the spectral Ádám property for circulant graphs, Discrete Math., 254, 309-329 (2002) · Zbl 1035.05059
[8] Misseldine, A. F., Algebraic and Combinatorial Properties of Schur Rings over Cyclic Groups (2014), Brigham Young University, PhD thesis
[9] Mönius, K., Constructions of isospectral circulant graphs, Elem. Math., 75, 2, 45-57 (2020) · Zbl 1455.05046
[10] Mönius, K., The algebraic degree of spectra of circulant graphs, J. Number Theory, 208, 295-304 (2020) · Zbl 1428.05200
[11] Mönius, K.; Steuding, J.; Stumpf, P., Which graphs have non-integral spectra?, Graphs Comb., 34, 6, 1507-1518 (2018) · Zbl 1402.05140
[12] Muzychuk, M., The structure of rational Schur rings over cyclic groups, Eur. J. Comb., 14, 479-490 (1993) · Zbl 0827.20003
[13] Muzychuk, M., On the structure of basic sets of Schur rings over cyclic groups, J. Algebra, 169, 655-678 (1994) · Zbl 0810.20005
[14] Muzychuk, M., A solution of the isomorphism problem for circulant graphs, Proc. Lond. Math. Soc., 88, 3, 1-41 (2004) · Zbl 1045.05052
[15] So, W., Integral circulant graphs, Discrete Math., 306, 153-158 (2005) · Zbl 1084.05045
[16] Wielandt, H., Finite Permutation Groups (1964), Academic Press: Academic Press New York · Zbl 0138.02501
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.