Signless Laplacian determinations of some graphs with independent edges
Abstract
Signless Laplacian determinations of some graphs with independent edges% Let G be a simple undirected graph. Then the signless Laplacian matrix of G is defined as DG + AG in which DG and AG denote the degree matrix and the adjacency matrix of G, respectively. The graph G is said to be determined by its signless Laplacian spectrum ( DQS, for short), if any graph having the same signless Laplacian spectrum as G is isomorphic to G. We show that G rK2 is determined by its signless Laplacian spectra under certain conditions, where r and K2 denote a natural number and the complete graph on two vertices, respectively. Applying these results, some DQS graphs with independent edges are obtained.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.