The spectrum of an I-graph

2015/11/11 by Allana S. S. de Oliveira, de Oliveira, Allana S. S., Cybele T. M. Vinagre +1
Computer Science · Mathematics · #05C50 #15B05 #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Graph theory and applications #Matrix Theory and Algorithms

paper · pdf · doi:10.48550/arxiv.1511.03513

openalex publication_date 2015/11/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We completely determine the spectrum of an I-graph, that is, the eigenvalues of its adjacency matrix. We apply our result to prove known characterizations of connectedness and bipartiteness in I-graphs by using an spectral approach. With our result, we also determine the nullity of a certain subfamily of I-graphs.

Related

• The graphs with all but two eigenvalues equal to -2 or 0
• The graphs with all but two eigenvalues equal to ± 1
• Graphs determined by their A_α-spectra
• Unsolved Problems in Spectral Graph Theory
• New matrices for the spectral theory of mixed graphs, part I