Which wheel graphs are determined by their Laplacian spectra?
From MaRDI portal
Publication:979802
DOI10.1016/j.camwa.2009.07.028zbMath1189.05111OpenAlexW2090847287MaRDI QIDQ979802
Yuanping Zhang, Xiaogang Liu, Xue-rong Yong
Publication date: 28 June 2010
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2009.07.028
Related Items
Graphs determined by their \(A_\alpha\)-spectra ⋮ Eigen-stratified models ⋮ Laplacian spectral characterization of some graph join ⋮ Some graphs determined by their (signless) Laplacian spectra ⋮ Laplacian spectrum characterization of extensions of vertices of wheel graphs and multi-fan graphs ⋮ Graphs determined by their generalized characteristic polynomials ⋮ On bi-regular graphs determined by their generalized characteristic polynomials ⋮ Laplacian spectral characterization of some graphs obtained by product operation ⋮ Laplacian spectral characterization of 3-rose graphs ⋮ Laplacian spectral characterization of some graph products ⋮ Some graphs determined by their (signless) Laplacian spectra ⋮ Laplacian spectral characterization of disjoint union of paths and cycles ⋮ Which \(Q\)-cospectral graphs have same degree sequences ⋮ The spectral determination of the connected multicone graphs ⋮ Delta invariant for Eulerian digraphs ⋮ On the restricted numerical range of the Laplacian matrix for digraphs
Cites Work
- Unnamed Item
- 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
- The multi-fan graphs are determined by their Laplacian spectra
- Developments on spectral characterizations of graphs
- Laplacian graph eigenvectors
- 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
- A note on the second largest eigenvalue of the laplacian matrix of a graph∗
- Eigenvalues of the Laplacian of a graph∗
- A new 5‐arc‐transitive cubic graph