Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On Isospectral Integral Circulant Graphs (2310.11545v1)

Published 17 Oct 2023 in math.CO, math.NT, and math.SP

Abstract: Understanding when two non-isomorphic graphs can have the same spectra is a classic problem that is still not completely understood, even for integral circulant graphs. We say that a natural number $N$ satisfies the \emph{integral spectral Ad`{a}m property (ISAP)} if any two integral circulant graphs of order $N$ with the same spectra must be isomorphic. It seems to be open whether all $N$ satisfy the ISAP; M\"{o}nius and So showed that $N$ satisfies the ISAP if $N = pk, pqk,$ or $pqr$. We show that: (a) for any prime factorization structure $N = p_1{a_1}\cdots p_k{a_k}$, $N$ satisfies the ISAP for "most" values of the $p_i$; (b) $N=p2qn$ satisfy the ISAP if $p,q$ are odd and $(q-1) \nmid (p-1)2(p+1)$; (c) all $N =p2q2$ satisfy the ISAP.

Summary

We haven't generated a summary for this paper yet.