G-2017-97
On distance Laplacian and distance signless Laplacian eigenvalues of graphs
, , and BibTeX reference
Let D(G)
, DL(G)=Diag(Tr)−D(G)
and DQ(G)=Diag(Tr)+D(G)
be, respectively, the distance matrix, the distance Laplacian matrix and the distance signless Laplacian matrix of graph G
, where
Diag(Tr)
denotes the diagonal matrix of the vertex transmissions in G
. The eigenvalues of DL(G)
and DQ(G)
will be denoted by
∂L1≥∂L2≥⋯≥∂Ln−1≥∂Ln=0
and ∂Q1≥∂Q2≥⋯≥∂Qn−1≥∂Qn
,
respectively. In this paper we study the properties of the distance Laplacian eigenvalues and the distance signless Laplacian eigenvalues of graph G
.
Published November 2017 , 19 pages
Research Axis
Research applications
Document
G1797.pdf (400 KB)