Electronic Journal of Linear Algebra · 2010 · 23 citations · 12 references
Natural SciencesMathematicsGraph VisualizationNetwork VisualizationSolar AstronomyGraph AlgorithmsGraph TheoryAdjacency MatricesAlgebraic Graph TheoryGraph LaplacianSigned GraphsSpectral Graph Theory
For a simple undirected graph G, the corresponding signless Laplacian matrix is defined as D(G) + A(G) in which D(G) and A(G) are degree matrix and adjacency matrix of G, respectively. The graph G is said to be determined by its signless Laplacian spectrum, if any graph having the same signless Laplacian spectrum as G is isomorphic to G. Also the Sun graph of order 2n is a cycle Cn with an edge terminating in a pendent vertex attached to each vertex. Among other things, one result in this paper is that the Sun graphs are determined by their signless Laplacian spectrum.
12
Laplacian matrices of graphs: a survey
Russell Merris · Linear Algebra and its Applications · 1994 · 1.5K citations
The Laplacian Spectrum of a Graph II
Robert Grone, Russell Merris · SIAM Journal on Discrete Mathematics · 1994 · 448 citations