On the spectral characterization of some unicyclic graphs

DOI10.1016/J.DISC.2011.05.034MaRDI QIDQ409334zbMATH OpenOpenAlexFDO

Authors Xiaogang Liu, Suijie Wang, Yuanping Zhang, Xuerong 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

zbMATH Keywords

\(A\)-spectrum\(L\)-spectrum\(Q\)-spectrum

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 6453536
• Laplacian spectral characterization of some unicyclic graphs
• Characterizing some class of unicyclic graphs by their Laplacian spectra
• scientific article; zbMATH DE number 6501376
• scientific article; zbMATH DE number 6453278

Cites work

• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• scientific article; zbMATH DE number 5642103 (Why is no real title available?)
• A certain polynomial of a graph and graphs with an extremal number of trees
• A new 5‐arc‐transitive cubic graph
• A note on the second largest eigenvalue of the laplacian matrix of a graph^∗
• Combinatorial matrix theory
• Constructing cospectral graphs
• Developments on spectral characterizations of graphs
• Matrix Analysis
• On a signless Laplacian spectral characterization of \(T\)-shape trees
• On the Laplacian eigenvalues of a graph
• On the spectral characterizations of \(\infty \)-graphs
• Q-integral graphs with edge-degrees at most five
• Signless Laplacians of finite graphs
• Spectra of unicyclic graphs
• Spectral characterizations of lollipop graphs
• Starlike trees are determined by their Laplacian spectrum
• The \(T\)-shape tree is determined by its Laplacian spectrum
• The characteristic polynomial of the Laplacian of graphs in (\(a\), \(b\))-linear classes
• The lollipop graph is determined by its spectrum
• The multi-fan graphs are determined by their Laplacian spectra
• The number of trees in a graph. I. II
• Which graphs are determined by their spectrum?

Cited in

(17)

• A new characterization of unichord-free graphs
• Which cospectral graphs have same degree sequences
• scientific article; zbMATH DE number 6501376 (Why is no real title available?)
• Some graphs determined by their (signless) Laplacian spectra
• scientific article; zbMATH DE number 6453278 (Why is no real title available?)
• scientific article; zbMATH DE number 6453536 (Why is no real title available?)
• Spectra of signed graphs
• Spectral characterization of unicyclic graphs whose second largest eigenvalue does not exceed 1
• Graphs determined by their \(A_\alpha\)-spectra
• Spectra of unicyclic graphs
• Laplacian spectral characterization of (broken) dandelion graphs
• Graphs determined by signless Laplacian spectra
• Laplacian spectral characterization of some graph products
• Laplacian spectral characterization of 3-rose graphs
• Laplacian spectral characterization of some unicyclic graphs
• Laplacian spectral characterization of some graphs obtained by product operation
• Spectra of subdivision-vertex join and subdivision-edge join of two graphs

This page was built for publication: On the spectral characterization of some unicyclic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409334)