•  
  •  
 

Keywords

Signless Laplacian spectrum, Q-cospectral, Join, Determined by the signless Laplacian spectrum

Abstract

The join of two disjoint graphs G and H, denoted by G ∨ H, is the graph obtained by joining each vertex of G to each vertex of H. In this paper, the signless Laplacian characteristic polynomial of the join of two graphs is first formulated. And then, a lower bound for the i-th largest signless Laplacian eigenvalue of a graph is given. Finally, it is proved that G ∨ K_m, where G is an (n − 2)-regular graph on n vertices, and K_n ∨ K_2 except for n = 3, are determined by their signless Laplacian spectra.

abs_vol30_pp443-454.pdf (30 kB)
Abstract

Share

COinS
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.