A note on the spectral characterization of \(\theta \)-graphs

DOI10.1016/j.laa.2009.03.013zbMath1203.05098MaRDI QIDQ1030726

B. Tayfeh-Rezaie, N. Broojerdian, Farzaneh Ramezani

Publication date: 2 July 2009

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

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

zbMATH Keywords

eigenvalues; cospectral graphs; spectral characterization; \(\theta \)-graphs

Mathematics Subject Classification ID

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

Related Items

On the spectral characterization of Π-shape trees, Per-spectral and adjacency spectral characterizations of a complete graph removing six edges, Signless Laplacian spectral characterization of the cones over some regular graphs, The spectral characterization of \(\infty\)-graphs, Graphs whose signless Laplacian spectral radius does not exceed the Hoffman limit value, A note on the spectral characterization of dumbbell graphs, On the spectral characterizations of \(\infty \)-graphs, Spectral characterization of the complete graph removing a path of small length, Spectral characterizations of graphs with small spectral radius, On bi-regular graphs determined by their generalized characteristic polynomials, The line graphs of lollipop graphs are determined by their spectra, Signless Laplacian spectral characterization of line graphs ofT-shape trees, Per-spectral characterizations of some edge-deleted subgraphs of a complete graph, On the signless Laplacian spectral characterization of the line graphs of T-shape trees, Laplacian spectral characterization of dumbbell graphs and theta graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
• Spectral characterizations of lollipop graphs
• Spectral characterization of the Hamming graphs
• On a Laplacian spectral characterization of graphs of index less than 2
• The lollipop graph is determined by its spectrum
• Developments on spectral characterizations of graphs
• Which graphs are determined by their spectrum?
• The complement of the path is determined by its spectrum
• On the spectral characterization of T-shape trees
• The spectral characterization of graphs of index less than 2 with no path as a component
• Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum
• No starlike trees are cospectral