摘要 : The distance Laplacian matrix of a connected graph G is defined as L(G) = Tr(G)-D(G), 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 L(G) is call... 展开 The distance Laplacian matrix of a connected graph G is defined as L(G) = Tr(G)-D(G), 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 L(G) is called the distance Laplacian spectral radius ofG. In this paper,wedetermine the graphs with themaximum distance Laplacian spectral radius and the minimum distance Laplacian spectral radius among all the bicyclic graphs with given order, respectively. 收起