A family of graphs that are determined by their normalized Laplacian spectra

DOI10.1016/j.laa.2018.03.001zbMath1385.05045arXiv1805.10832OpenAlexW2789433975WikidataQ130184933 ScholiaQ130184933MaRDI QIDQ1748074

Wen-Zhe Liang, Abraham Berman, Zhibing Chen, Dong-Mei Chen, Xiao Dong Zhang

Publication date: 2 May 2018

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

Full work available at URL: https://arxiv.org/abs/1805.10832

zbMATH Keywords

spectral characterizationgeneralized friendship graphcospectral graphnormalized Laplacian spectrum

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (4)

Unnamed Item ⋮ Complete multipartite graphs that are determined, up to switching, by their Seidel spectrum ⋮ On the multiplicities of normalized Laplacian eigenvalues of graphs ⋮ Normalized Laplacian spectrum of complete multipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A cospectral family of graphs for the normalized Laplacian found by toggling
• Graphs whose normalized Laplacian has three eigenvalues
• Laplacian spectrum characterization of extensions of vertices of wheel graphs and multi-fan graphs
• A construction of cospectral graphs for the normalized Laplacian
• On the two largest \(Q\)-eigenvalues of graphs
• The multi-fan graphs are determined by their Laplacian spectra
• Developments on spectral characterizations of graphs
• Which graphs are determined by their spectrum?
• The graphs with all but two eigenvalues equal to \(\pm 1\)
• Algebraic aspects of the normalized Laplacian

This page was built for publication: A family of graphs that are determined by their normalized Laplacian spectra