On the spectral characterization of some unicyclic graphs
From MaRDI portal
Publication:409334
DOI10.1016/j.disc.2011.05.034zbMath1242.05165MaRDI QIDQ409334
Xiaogang Liu, Yuanping Zhang, Suijie Wang, Xue-rong Yong
Publication date: 13 April 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.05.034
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
Graphs determined by signless Laplacian spectra, Laplacian spectral characterization of some graphs obtained by product operation, Laplacian spectral characterization of some graph products, Graphs determined by their \(A_\alpha\)-spectra, Spectra of subdivision-vertex join and subdivision-edge join of two graphs, Which cospectral graphs have same degree sequences, Spectra of signed graphs, Laplacian spectral characterization of (broken) dandelion graphs, Laplacian spectral characterization of some unicyclic graphs, Laplacian spectral characterization of 3-rose graphs, Some graphs determined by their (signless) Laplacian spectra
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing cospectral graphs
- On a signless Laplacian spectral characterization of \(T\)-shape trees
- The \(T\)-shape tree is determined by its Laplacian spectrum
- Starlike trees are determined by their Laplacian spectrum
- Signless Laplacians of finite graphs
- Spectral characterizations of lollipop graphs
- The multi-fan graphs are determined by their Laplacian spectra
- Q-integral graphs with edge-degrees at most five
- On the spectral characterizations of \(\infty \)-graphs
- The lollipop graph is determined by its spectrum
- Developments on spectral characterizations of graphs
- Spectra of unicyclic graphs
- On the Laplacian eigenvalues of a graph
- A certain polynomial of a graph and graphs with an extremal number of trees
- Which graphs are determined by their spectrum?
- The characteristic polynomial of the Laplacian of graphs in (\(a\), \(b\))-linear classes
- The number of trees in a graph. I. II
- A note on the second largest eigenvalue of the laplacian matrix of a graph∗
- Matrix Analysis
- A new 5‐arc‐transitive cubic graph
