Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
From MaRDI portal
Publication:1637095
DOI10.1007/s00373-018-1880-1zbMath1388.05116arXiv1708.07979OpenAlexW2963454914MaRDI QIDQ1637095
Lu Lu, Xueyi Huang, Qiong Xiang Huang
Publication date: 7 June 2018
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.07979
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items
On the multiplicity of the least signless Laplacian eigenvalue of a graph, On graphs with three distinct signless Laplacian eigenvalues, Distance-regular graphs with a few \(q\)-distance eigenvalues, Graphs with three distinct distance eigenvalues, On graphs with exactly one anti-adjacency eigenvalue and beyond, Distance eigenvalues of a cograph and their multiplicities, Complex unit gain graphs with exactly one positive eigenvalue, On the sum of \(k\) largest distance eigenvalues of graphs, Graphs with few distinct \(D\)-eigenvalues determined by their \(D\)-spectra, On the Dα-spectra of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Biregular graphs with three eigenvalues
- Hypercubes are determined by their distance spectra
- On graphs with just three distinct eigenvalues
- On regular graphs with four distinct eigenvalues
- The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\)
- Graphs with four distinct Laplacian eigenvalues
- The graphs with the least distance eigenvalue at least \(-\frac{1 + \sqrt{17}}{2}\)
- Small regular graphs with four eigenvalues
- On graphs with at least three distance eigenvalues less than \(-1\)
- The graphs with all but two eigenvalues equal to \(\pm 1\)
- The graphs with all but two eigenvalues equal to \(-2\) or 0
- Distance-regular graphs with small number of distinct distance eigenvalues
- On the least distance eigenvalue and its applications on the distance spread
- On the least distance eigenvalue of a graph
- Complete multipartite graphs are determined by their distance spectra
- On a property of the class of n-colorable graphs
- On the distance spectrum of graphs
- On the second largest distance eigenvalue of a graph
- On the second largest distance eigenvalue