Graphs cospectral with starlike trees

DOI10.1016/j.laa.2008.01.001zbMath1152.05043OpenAlexW2061043400MaRDI QIDQ952060

B. Tayfeh-Rezaie, Farzaneh Ramezani, Narges Ghareghani

Publication date: 6 November 2008

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

Full work available at URL: https://doi.org/10.1016/j.laa.2008.01.001

zbMATH Keywords

characteristic polynomialsstarlike treescospectral graphs

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (8)

The spectral characterization of wind-wheel graphs ⋮ Codeterminantal graphs ⋮ Bipartite graphs with all but two eigenvalues equal to \(0\) and \(\pm 1\) ⋮ On the divisibility of H-shape trees and their spectral determination ⋮ The critical polynomial of a graph ⋮ Starlike trees whose maximum degree exceed 4 are determined by their Q-spectra ⋮ On the ordering of trees by the Laplacian coefficients ⋮ Vertex-degree-based topological indices over starlike trees

Cites Work

• The spectral radii of a graph and its line graph
• Starlike trees are determined by their Laplacian spectrum
• Developments on spectral characterizations of graphs
• Which graphs are determined by their spectrum?
• Some results on starlike and sunlike graphs
• On the spectral characterization of T-shape trees
• A new graph product and its spectrum
• Matchings in starlike trees
• No starlike trees are cospectral
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graphs cospectral with starlike trees