Signless Laplacian spectral characterization of 4-rose graphs

DOI10.1080/03081087.2016.1161705zbMath1352.05050OpenAlexW2304359706MaRDI QIDQ2953396

Xiaoling Ma, Qiong Xiang Huang

Publication date: 4 January 2017

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2016.1161705

zbMATH Keywords

signless Laplacian spectrum\(r\)-cyclic graph4-rose graphdetermined by signless Laplacian spectrum

Mathematics Subject Classification ID

Trees (05C05)

Related Items (5)

A special class of triple starlike trees characterized by Laplacian spectrum ⋮ Laplacian spectral characterization of roses ⋮ Laplacian spectral characterization of (broken) dandelion graphs ⋮ A large family of cospectral Cayley graphs over dicyclic groups ⋮ A new arithmetic criterion for graphs being determined by their generalized \(Q\)-spectrum

Cites Work

• On the two largest \(Q\)-eigenvalues of graphs
• Signless Laplacians of finite graphs
• On the spectral characterizations of \(\infty \)-graphs
• A conjecture on the algebraic connectivity of connected graphs with fixed girth
• Developments on spectral characterizations of graphs
• On graphs whose signless Laplacian index does not exceed 4.5
• Which graphs are determined by their spectrum?
• Towards a spectral theory of graphs based on the signless Laplacian, I
• On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph

This page was built for publication: Signless Laplacian spectral characterization of 4-rose graphs