Abstract
The distance Laplacian matrix of a connected graph G is defined as , where Tr(G) is the diagonal matrix of the vertex transmissions in G and D(G) is the distance matrix of G. The largest eigenvalue of
is called the distance Laplacian spectral radius of G. In this paper, we determine the graphs with the maximum distance Laplacian spectral radius and the minimum distance Laplacian spectral radius among all the bicyclic graphs with given order, respectively.
Disclosure statement
No potential conflict of interest was reported by the author(s).