Proof of conjectures on the distance signless Laplacian eigenvalues of graphs

Let G=(V,E)G=(V,E) be a simple graph with vertex set V(G)={v1,v2,…,vn}V(G)={v1,v2,…,vn} and edge set E(G)E(G). The distance signless Laplacian spectral radius of a connected graph G is the spectral radius of the distance signless Laplacian matrix of G, defined asQ(G)=Tr(G)+D(G),Q(G)=Tr(G)+D(G), where Tr(G)Tr(G) is the diagonal matrix of vertex transmissions of G   and D(G)D(G) is the distance matrix of G. In [10], Xing et al. determined the graph with minimum distance signless Laplacian spectral radius among the trees with fixed number of vertices. For n≥3n≥3, let Tn−3,11 be the n  -vertex tree of maximum degree n−2n−2. In this paper, we show that Tn−3,11 gives the second minimum distance signless Laplacian spectral radius among the trees with fixed number of vertices. Moreover, we prove two conjectures involving the second largest eigenvalue of the distance signless Laplacian matrix Q(G)Q(G) of graph G.