The lollipop graph is determined by its \(Q\)-spectrum

DOI10.1016/j.disc.2008.09.052zbMath1182.05084MaRDI QIDQ1025961

Yuanping Zhang, Xiaogang Liu, Bingyan Zhang, Xue-rong Yong

Publication date: 23 June 2009

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

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

zbMATH Keywords

eigenvalues; cospectral graphs; spectrum of a graph

Mathematics Subject Classification ID

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

Related Items

Some graphs determined by their (signless) Laplacian spectra, Signless Laplacian spectral characterization of the cones over some regular graphs, Laplacian spectral characterization of some graphs obtained by product operation, Proof of conjecture involving the second largest signless Laplacian eigenvalue and the index of graphs, The algebraic connectivity of lollipop graphs, Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphs, On incidence energy of a graph, Towards a spectral theory of graphs based on the signless Laplacian. II., On conjectures involving second largest signless Laplacian eigenvalue of graphs, Erratum to ``The lollipop graph is determined by its \(Q\)-spectrum, On the spectral characterizations of \(\infty \)-graphs, The line graphs of lollipop graphs are determined by their spectra, Spectral characterization of line graphs of starlike trees

Cites Work

• Unnamed Item
• Constructing cospectral graphs
• 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
• 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
• The lollipop graph is determined by its spectrum
• Laplacian matrices of graphs: A survey
• Which graphs are determined by their spectrum?
• Enumeration of cospectral graphs.
• Minimizing algebraic connectivity over connected graphs with fixed girth
• The complement of the path is determined by its spectrum
• On the spectral characterization of T-shape trees
• Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum
• Matrix Analysis