Disjoint unions of complete graphs characterized by their Laplacian spectrum

DOI10.13001/1081-3810.1344zbMath1189.05099OpenAlexW2132066748MaRDI QIDQ3559074

Romain Boulet

Publication date: 11 May 2010

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/225983

zbMATH Keywords

strongly regular graphgraphsLaplaciancomplete graphgraph determined by its spectrum

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (4)

Laplacian spectral characterization of some graphs obtained by product operation ⋮ On distance Laplacian spectral determination of complete multipartite graphs ⋮ Some graphs determined by their (signless) Laplacian spectra ⋮ Unnamed Item

This page was built for publication: Disjoint unions of complete graphs characterized by their Laplacian spectrum