On graphs with just three distinct eigenvalues

DOI10.1016/J.LAA.2016.06.031zbMATH Open1343.05096OpenAlexW2466235430MaRDI QIDQ306478FDOQ306478

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

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

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)

Cites Work

• The main eigenvalues of a graph: a survey
• An introduction to the theory of graph spectra
• Title not available (Why is that?)
• Distance regular graphs of diameter 3 and strongly regular graphs
• Nonregular graphs with three eigenvalues
• On graphs with three eigenvalues
• Biregular graphs with three eigenvalues
• Multiplicative designs II. Uniform normal and related structures
• An infinite family of symmetric designs

Cited In (31)

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

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)