Graphs with three eigenvalues and second largest eigenvalue at most 1
DOI10.1016/J.JCTB.2017.09.004zbMATH Open1379.05072arXiv1506.02435OpenAlexW3105835307MaRDI QIDQ684121FDOQ684121
Authors: Gary R. W. Greaves, Jack H. Koolen, Ximing Cheng
Publication date: 9 February 2018
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.02435
Recommendations
- On graphs whose second largest eigenvalue is at most 1
- Graphs with second largest eigenvalue less than 1/2
- On graphs with second largest eigenvalue less than 1
- On graphs whose second largest eigenvalue is less than 1
- Graphs with three distinct eigenvalues and largest eigenvalue less than 8
- On the third largest eigenvalue of graphs
- On the third largest eigenvalue of a graph
- On graphs with three eigenvalues
- On tricyclic graphs whose second largest eigenvalue does not exceed 1
- Regular graphs whose second largest eigenvalue is at most 1
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12)
Cites Work
- The Magma algebra system. I: The user language
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graphs with three distinct eigenvalues and largest eigenvalue less than 8
- Nonregular graphs with three eigenvalues
- On graphs with three eigenvalues
- The combinatorics of Dom de Caen
- Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
- Biregular graphs with three eigenvalues
- On graphs with just three distinct eigenvalues
- ON THE MULTIPLICITIES OF GRAPH EIGENVALUES
- Graphs with many valencies and few eigenvalues
- The minimal spectral radius of graphs with a given diameter
- Line graphs, root systems, and elliptic geometry
- Title not available (Why is that?)
- On tricyclic graphs whose second largest eigenvalue does not exceed 1
Cited In (26)
- Graphs for which the second largest distance eigenvalue is less than \(- \frac{1}{2}\)
- A problem concerning graphs with just three distinct eigenvalues
- Signed graphs with at most three eigenvalues
- On graphs with three distinct signless Laplacian eigenvalues
- Some new aspects of main eigenvalues of graphs
- The spectral determinations of the join of two friendship graphs
- On the spectral determinations of the connected multicone graphs \(K_r \nabla sK_t\)
- Characterization of graphs with an eigenvalue of large multiplicity
- The spectral determinations of connected multicone graphs \(K_{\mathcal{W}} \operatorname{\nabla} mCP(n)\)
- Hypercubes are determined by their distance spectra
- More on signed graphs with at most three eigenvalues
- Title not available (Why is that?)
- On the multiplicity of the least signless Laplacian eigenvalue of a graph
- Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
- Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\)
- Connected \((K_4 - e)\)-free graphs whose second largest eigenvalue does not exceed 1
- Signed graphs with three eigenvalues: biregularity and beyond
- On tricyclic graphs whose second largest eigenvalue does not exceed 1
- On graphs whose second largest eigenvalue is at most 1
- Characterization of outerplanar graphs whose second largest eigenvalue is at most 1
- Bipartite graphs with all but two eigenvalues equal to \(0\) and \(\pm 1\)
- Graphs with second largest eigenvalue less than 1/2
- The \(T_{1,2}\)-free planar graphs whose second largest eigenvalue does not exceed 1
- Quadratic embedding constants of graph joins
- On claw-free graphs with all but four eigenvalues equal to \(0\) or \(-1\)
- Spectral characterization of the complete graph removing a cycle
Uses Software
This page was built for publication: Graphs with three eigenvalues and second largest eigenvalue at most 1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q684121)