4 research outputs found

    Signless Laplacian determinations of some graphs with independent edges

    Get PDF
    Let GG be a simple undirected graph. Then the signless Laplacian matrix of GG is defined as DG+AGD_G + A_G in which DGD_G and AGA_G denote the degree matrix and the adjacency matrix of GG, respectively. The graph GG is said to be determined by its signless Laplacian spectrum (DQS, for short), if any graph having the same signless Laplacian spectrum as GG is isomorphic to GG. We show that GβŠ”rK2G\sqcup rK_2 is determined by its signless Laplacian spectra under certain conditions, where rr and K2K_2 denote a natural number and the complete graph on two vertices, respectively. Applying these results, some DQS graphs with independent edges are obtained
    corecore