Lu Lu

activity

20162023

most citedThe graphs with exactly two distance eigenvalues different from

- 1

and

- 3

20 citations · 26 across the 13 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

math.CO2017

Graphs with at most three distance eigenvalues different from $- 1$ and $- 2$

Xueyi Huang, Qiongxiang Huang, Lu Lu

Let $G$ be a connected graph on $n$ vertices, and let $D (G)$ be the distance matrix of $G$ . Let $\partial_{1} (G) \geq \partial_{2} (G) \geq \dots \geq \partial_{n} (G)$ denote the eigenvalues of $…

math.CO2017

On graphs with $m (\partial_{1}^{L}) = n - 3$

Lu Lu, Qiongxiang Huang, Xueyi Huang

Let $\partial_{1}^{L} \geq \partial_{2}^{L} \geq \dots \geq \partial_{n}^{L}$ be the distance Laplacian eigenvalues of a connected graph $G$ and $m (\partial_{i}^{L})$ the multiplicity of $\partial_{i}^{L}$ . I…

Graphs with at most three distance eigenvalues different from −1 and −2

On graphs with m(∂1L​)=n−3

Graphs with at most three distance eigenvalues different from $- 1$ and $- 2$

On graphs with $m (\partial_{1}^{L}) = n - 3$