Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Isospectral Integral Circulant Graphs

Published 17 Oct 2023 in math.CO, math.NT, and math.SP | (2310.11545v1)

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

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.