A short note on the sum of k largest distance eigenvalues of bipartite graphs
Abstract
Let $G$ be a connected graph on $n$ vertices and $k\ge 1$. We prove that the sum of the first two distance eigenvalues is not greater than $2n-4$, which confirm a conjecture proposed by Lin.
Type
Publication
In Discrete Applied Mathematics
Click the Cite button above to demo the feature to enable visitors to import publication metadata into their reference management software.
Create your slides in Markdown - click the Slides button to check out the example.
Supplementary notes can be added here, including code, math, and images.
Lu Lu(鲁卢)
Associate Professor, PhD Supervisor
My research interests include algebraic graph theory, spectral graph theory and group theory.