Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On graphs with distance Laplacian eigenvalues of multiplicity $n-4$   Let $G$ be a connected simple graph with $n$ vertices. The distance Laplacian
matrix $D^{L}(G)$ is defined as $D^L(G)=Diag(Tr)-D(G)$, where $Diag(Tr)$ is the
diagonal matrix of vertex transmissions and $D(G)$ is the distance matrix of
$G$. The eigenvalues of $D^{L}(G)$ are the distance Laplacian eigenvalues of
$G$ and are denoted by $\partial_{1}^{L}(G)\geq \partial_{2}^{L}(G)\geq \dots
\geq \partial_{n}^{L}(G)$. The largest eigenvalue $\partial_{1}^{L}(G)$ is
called the distance Laplacian spectral radius. Lu et al. (2017), Fernandes et
al. (2018) and Ma et al. (2018) completely characterized the graphs having some
distance Laplacian eigenvalue of multiplicity $n-3$. In this paper, we
characterize the graphs having distance Laplacian spectral radius of
multiplicity $n-4$ together with one of the distance Laplacian eigenvalue as
$n$ of multiplicity either 3 or 2. Further, we completely determine the graphs
for which the distance Laplacian eigenvalue $n$ is of multiplicity $n-4$.

21
The categories of this paper are: adap-org
24
The categories of this paper are: dg-ga
14
The categories of this paper are: math-ph
18
The categories of this paper are: econ
0
The categories of this paper are: hep-ph
11
The categories of this paper are: hep-lat
15
The categories of this paper are: nucl-ex
37
The categories of this paper are: supr-con
16
The categories of this paper are: stat
36
The categories of this paper are: cmp-lg
9
The categories of this paper are: nlin
35
The categories of this paper are: mtrl-th
13
The categories of this paper are: quant-ph
26
The categories of this paper are: bayes-an
30
The categories of this paper are: q-alg
12
The categories of this paper are: nucl-th