# On graphs with at least three distance eigenvalues less than −1☆

@article{Lin2014OnGW,
title={On graphs with at least three distance eigenvalues less than −1☆},
author={Huiqiu Lin and Mingqing Zhai and Shicai Gong},
journal={Linear Algebra and its Applications},
year={2014},
volume={458},
pages={548-558}
}
• Published 1 October 2014
• Mathematics
• Linear Algebra and its Applications
16 Citations
The multiplicity of -2 as an eigenvalue of the distance matrix of graphs
• Mathematics
• 2018
Let D(G) be the distance matrix and let λ1(D(G)) ≥ · · · ≥ λn(D(G)) be the corresponding eigenvalues of a connected graph G. Let mλ(D) denote the multiplicity of the eigenvalue λ of the distance
On the second largest distance eigenvalue of a graph
• Mathematics
• 2015
Let G be a simple connected graph of order n and D(G) be the distance matrix of G. Suppose that is the distance spectrum of G. A graph G is said to be determined by its D-spectrum if any graph with
On the Second Least Distance Eigenvalue of a Graph
• Mathematics
• 2017
Let $G$ be a connected graph on $n$ vertices, and let $D(G)$ be the distance matrix of $G$. Let $\partial_1(G)\ge\partial_2(G)\ge\cdots\ge\partial_n(G)$ denote the eigenvalues of $D(G)$. In this
Spectral Gap of the Largest Eigenvalue of the Normalized Graph Laplacian
• Mathematics
• 2019
We offer a new method for proving that the maximal eigenvalue of the normalized graph Laplacian of a graph with $n$ vertices is at least $\frac{n+1}{n-1}$ provided the graph is not complete and that
Some Graphs Determined By Their Distance Spectrum
• Mathematics
• 2018
Let $G$ be a connected graph with order $n$. Let $\lambda_1(D(G))\geq \cdots\geq \lambda_n(D(G))$ be the distance spectrum of $G$. In this paper, it is shown that the complements of $P_n$ and $C_n$