The multi-fan graphs are determined by their Laplacian spectra

DOI10.1016/j.disc.2007.08.002zbMath1225.05172MaRDI QIDQ941355

Yuanping Zhang, Xiaogang Liu, Xiangquan Gui

Publication date: 4 September 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.002

zbMATH Keywords

eigenvalues; Laplacian spectrum; cospectral graphs; multi-fan graphs

Mathematics Subject Classification ID

05C38: Paths and cycles

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

Related Items

Some graphs determined by their (signless) Laplacian spectra, On the spectral characterization of some unicyclic graphs, Laplacian spectral characterization of some graphs obtained by product operation, The spectral characterization of \(\infty\)-graphs, Laplacian spectral characterization of some graph products, Spectral characterization of graphs whose second largest eigenvalue is less than 1, Laplacian spectrum characterization of extensions of vertices of wheel graphs and multi-fan graphs, Graphs determined by their generalized characteristic polynomials, On the two largest \(Q\)-eigenvalues of graphs, A note on the spectral characterization of dumbbell graphs, Some graphs determined by their spectra, Which wheel graphs are determined by their Laplacian spectra?, Developments on spectral characterizations of graphs, The lollipop graph is determined by its \(Q\)-spectrum, Spectral characterizations of sandglass graphs, On the asymptotic behavior of graphs determined by their generalized spectra, Laplacian spectral characterization of disjoint union of paths and cycles, Determination of double quasi-star tree from its Laplacian spectrum

Cites Work

• The \(T\)-shape tree is determined by its Laplacian spectrum
• Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
• Starlike trees are determined by their Laplacian spectrum
• Spanning tree formulas and Chebyshev polynomials
• A certain polynomial of a graph and graphs with an extremal number of trees
• Which graphs are determined by their spectrum?
• The Laplacian spectrum of a graph
• On the spectral characterization of T-shape trees
• Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum
• The number of trees in a graph. I. II
• Bounds for eigenvalues of doubly stochastic matrices
• A note on the second largest eigenvalue of the laplacian matrix of a graph^∗
• Eigenvalues of the Laplacian of a graph^∗