Signless Laplacian determinations of some graphs with independent edges

Keywords:
spectral characterization, signless Laplacian spectrum, cospectral graphs, union of graphsAbstract
Let be a simple undirected graph. Then the signless Laplacian matrix of is defined as in which and denote the degree matrix and the adjacency matrix of , respectively. The graph is said to be determined by its signless Laplacian spectrum (DQS, for short), if any graph having the same signless Laplacian spectrum as is isomorphic to . We show that is determined by its signless Laplacian spectra under certain conditions, where and denote a natural number and the complete graph on two vertices, respectively. Applying these results, some DQS graphs with independent edges are obtained.