vix.ing · top · new · best · stats · spec

Graphs with three and four distinct eigenvalues based on circulants

2023/10/09 by Milan Bašić, Bašić, Milan
Chemistry · Mathematics · #05C50 #05E30 #11A07 #11A15 #11A25 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Ferrocene Chemistry and Applications #Graph theory and applications #Synthesis and Properties of Aromatic Compounds

paper · pdf · doi:10.48550/arxiv.2310.06203

openalex publication_date 2023/10/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we aim to address the open questions raised in various recent papers regarding characterization of circulant graphs with three or four distinct eigenvalues in their spectra. Our focus is on providing characterizations and constructing classes of graphs falling under this specific category. We present a characterization of circulant graphs with prime number order and unitary Cayley graphs with arbitrary order, both of which possess spectra displaying three or four distinct eigenvalues. Various constructions of circulant graphs with composite orders are provided whose spectra consist of four distinct eigenvalues. These constructions primarily utilize specific subgraphs of circulant graphs that already possess two or three eigenvalues in their spectra, employing graph operations like the tensor product, the union, and the complement. Finally, we characterize the iterated line graphs of unitary Cayley graphs whose spectra contain three or four distinct eigenvalues, and we show their non-circulant nature.

Related