文摘
For a connected graph GG, the distance Laplacian spectral radius of GG is the spectral radius of its distance Laplacian matrix L(G)L(G) defined as L(G)=Tr(G)−D(G)L(G)=Tr(G)−D(G), where Tr(G)Tr(G) is a diagonal matrix of vertex transmissions of GG and D(G)D(G) is the distance matrix of GG. In this paper, we study the change in the distance Laplacian spectral radius of graphs by some graft transformations, and as applications, we determine the unique graphs with minimum distance Laplacian spectral radius among non-caterpillar trees, and among non-starlike non-caterpillar trees, respectively, we prove that the path is the unique graph with maximum distance Laplacian spectral radius among connected graphs, and determine the unique graph with maximum distance Laplacian spectral radius among connected graphs with given clique number.
