On graphs with just three distinct eigenvalues

DOI10.1016/j.laa.2016.06.031zbMath1343.05096OpenAlexW2466235430MaRDI QIDQ306478

Peter Rowlinson

Publication date: 31 August 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2016.06.031

zbMATH Keywords

strongly regular graphminimum degreemain eigenvaluesymmetric 2-designvertex-deleted subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Vertex degrees (05C07)

Related Items

More on graphs with just three distinct eigenvalues ⋮ Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\) ⋮ On the multiplicity of the least signless Laplacian eigenvalue of a graph ⋮ On regular graphs with four distinct eigenvalues ⋮ More on signed graphs with at most three eigenvalues ⋮ Signed graphs with at most three eigenvalues ⋮ On graphs with three distinct signless Laplacian eigenvalues ⋮ On the multiplicity of Laplacian eigenvalues for unicyclic graphs ⋮ On 2-equitable graphs ⋮ Graphs with two main and two plain eigenvalues ⋮ Complete characterization of the bidegreed split graphs with three or four distinct \(A_{\alpha}\)-eigenvalues ⋮ Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\) ⋮ On split graphs with three or four distinct (normalized) Laplacian eigenvalues ⋮ The main vertices of a star set and related graph parameters ⋮ A problem concerning graphs with just three distinct eigenvalues ⋮ Characterization of graphs with an eigenvalue of large multiplicity ⋮ Graphs with three eigenvalues and second largest eigenvalue at most 1 ⋮ On signed graphs with just two distinct Laplacian eigenvalues ⋮ Unnamed Item ⋮ Signed graphs with three eigenvalues: biregularity and beyond ⋮ Graphs with some distance Laplacian eigenvalue of multiplicity \(n-3\) ⋮ Some new aspects of main eigenvalues of graphs ⋮ The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Biregular graphs with three eigenvalues
• An infinite family of symmetric designs
• Distance regular graphs of diameter 3 and strongly regular graphs
• Multiplicative designs II. Uniform normal and related structures
• Nonregular graphs with three eigenvalues
• On graphs with three eigenvalues

This page was built for publication: On graphs with just three distinct eigenvalues