Some graphs determined by their (signless) Laplacian spectra

DOI10.1007/s10587-012-0067-9zbMath1274.05299OpenAlexW2029120765MaRDI QIDQ4909753

Muhuo Liu

Publication date: 21 March 2013

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10338.dmlcz/143048

zbMATH Keywords

adjacency matrixLaplacian spectrumsignless Laplacian spectrumwheelscomplement graphmaximal spectral radius

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (12)

Signless Laplacian spectral characterization of some disjoint union of graphs ⋮ Laplacian spectral characterization of some graph join ⋮ The spectral characterization of wind-wheel graphs ⋮ The spectral characterization of butterfly-like graphs ⋮ Signless Laplacian determinations of some graphs with independent edges ⋮ The fan graph is determined by its signless Laplacian spectrum ⋮ Graphs determined by signless Laplacian spectra ⋮ Which \(Q\)-cospectral graphs have same degree sequences ⋮ Laplacian spectral determination of path-friendship graphs ⋮ The spectral determination of the connected multicone graphs ⋮ Which cospectral graphs have same degree sequences ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the signless Laplacian index of cacti with a given number of pendant vertices
• On the Estrada and Laplacian Estrada indices of graphs
• The effect on the Laplacian spectral radius of a graph by adding or grafting edges
• Some graphs determined by their spectra
• Signless Laplacians of finite graphs
• The multi-fan graphs are determined by their Laplacian spectra
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• On conjectures involving second largest signless Laplacian eigenvalue of graphs
• Which wheel graphs are determined by their Laplacian spectra?
• Trees with minimal Laplacian coefficients
• The lollipop graph is determined by its \(Q\)-spectrum
• Laplacian matrices of graphs: A survey
• Which graphs are determined by their spectrum?
• The Laplacian spectrum of a graph
• Sharp upper bounds for the Laplacian graph eigenvalues
• The complement of the path is determined by its spectrum
• Interlacing eigenvalues and graphs
• Hamilton cycles and eigenvalues of graphs
• A note on the second largest eigenvalue of the laplacian matrix of a graph^∗
• The (signless) Laplacian spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices
• A class of reflexive cactuses with four cycles
• Note on deleting a vertex and weak interlacing of the Laplacian spectrum
• Matrix Analysis
• On the index of cactuses with n vertices

This page was built for publication: Some graphs determined by their (signless) Laplacian spectra