On graphs with just three distinct eigenvalues

DOI10.1016/J.LAA.2016.06.031MaRDI QIDQ306478zbMATH OpenOpenAlexFDO

Authors P. 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

minimum degreestrongly regular graphmain eigenvaluesymmetric 2-designvertex-deleted subgraph

Mathematics Subject Classification ID

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

Recommendations

• More on graphs with just three distinct eigenvalues
• On graphs with three eigenvalues
• A note on graphs whose signless Laplacian has three distinct eigenvalues
• Graphs with three distinct \(\alpha\)-eigenvalues
• Biregular graphs with three eigenvalues

Cites work

• scientific article; zbMATH DE number 2117218 (Why is no real title available?)
• An infinite family of symmetric designs
• An introduction to the theory of graph spectra
• Biregular graphs with three eigenvalues
• 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
• The main eigenvalues of a graph: a survey

Cited in

(32)

• On graphs with three distinct Laplacian eigenvalues
• Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
• The main vertices of a star set and related graph parameters
• The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5
• On graphs with three distinct signless Laplacian eigenvalues
• On 2-equitable graphs
• On graphs with at least three distance eigenvalues less than \(-1\)
• On the multiplicity of the least signless Laplacian eigenvalue of a graph
• Extremizing first eigenvalue of 3-colored digraphs made with given blocks
• Biregular graphs with three eigenvalues
• Graphs with some distance Laplacian eigenvalue of multiplicity \(n-3\)
• Some new aspects of main eigenvalues of graphs
• Regular bipartite graphs with three distinct non-negative eigenvalues
• Graphs with two main and two plain eigenvalues
• Graphs whose normalized Laplacian has three eigenvalues
• Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\)
• More on graphs with just three distinct eigenvalues
• Characterization of graphs with an eigenvalue of large multiplicity
• On the multiplicity of Laplacian eigenvalues for unicyclic graphs
• scientific article; zbMATH DE number 15252 (Why is no real title available?)
• More on signed graphs with at most three eigenvalues
• On graphs with three eigenvalues
• A problem concerning graphs with just three distinct eigenvalues
• Graphs with three distinct \(\alpha\)-eigenvalues
• On signed graphs with just two distinct Laplacian eigenvalues
• On split graphs with three or four distinct (normalized) Laplacian eigenvalues
• On regular graphs with four distinct eigenvalues
• Complete characterization of the bidegreed split graphs with three or four distinct \(A_{\alpha}\)-eigenvalues
• Graphs with three eigenvalues and second largest eigenvalue at most 1
• Unicyclic graphs with five Laplacian eigenvalues different from 0 and 1
• Signed graphs with three eigenvalues: biregularity and beyond
• Signed graphs with at most three eigenvalues

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306478)