On (distance) signless Laplacian spectra of graphs

Let Q(G), D(G) and D^Q(G) = Diag(Tr) + D(G) be, respectively, the signless Laplacian matrix, the distance 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 Q(G) and D^Q(G) will be denoted by q₁≥ q₂≥ ⋯ ≥ q_n-1≥ q_n and ∂1Q≥∂2Q≥⋯≥∂n-1Q≥∂nQ , respectively. A graph G which does not share its distance signless Laplacian spectrum with any other non-isomorphic graphs is said to be determined by its distance signless Laplacian spectrum. Characterizing graphs with respect to spectra of graph matrices is challenging. In literature, there are many graphs that are proved to be determined by the spectra of some graph matrices (adjacency matrix, Laplacian matrix, signless Laplacian matrix, distance matrix etc.). But there are much fewer graphs that are proved to be determined by the distance signless Laplacian spectrum. Namely, the path graph, the cycle graph, the complement of the path and the complement of the cycle are proved to be determined by the distance signless Laplacian spectra. In this paper, we establish Nordhaus–Gaddum-type results for the least signless Laplacian eigenvalue of graph G. Moreover, we prove that the join graph G∨ K_q is determined by the distance singless Laplacian spectrum when G is a p- 2 regular graph of order p. Finally, we show that the short kite graph and the complete split graph are determined by the distance signless Laplacian spectra. Our approach for characterizing these graphs with respect to distance signless Laplacian spectra is different from those given in literature.