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

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

Xiaogang Liu, Bingyan Zhang, Yuanping 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

eigenvaluescospectral graphsspectrum of a graph

Mathematics Subject Classification ID

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

Related Items

Graphs determined by their \(A_\alpha\)-spectra ⋮ A special class of triple starlike trees characterized by Laplacian spectrum ⋮ On incidence energy of a graph ⋮ The spectral characterization of wind-wheel graphs ⋮ Laplacian spectral characterization of clover graphs ⋮ Signless Laplacian spectral characterization of line graphs ofT-shape trees ⋮ Interlace polynomials of lollipop and tadpole graphs ⋮ On the signless Laplacian spectral determination of the join of regular graphs ⋮ Some graphs determined by their (signless) Laplacian spectra ⋮ On the signless Laplacian spectral characterization of the line graphs of T-shape trees ⋮ Signless Laplacian determinations of some graphs with independent edges ⋮ On the (signless) Laplacian spectral characterization of the line graphs of lollipop graphs ⋮ Some graphs determined by their \(A_\alpha\)-spectra ⋮ Signless Laplacian spectral characterization of the cones over some regular graphs ⋮ Laplacian spectral characterization of some graphs obtained by product operation ⋮ The line graphs of lollipop graphs are determined by their spectra ⋮ The algebraic connectivity of lollipop graphs ⋮ Spectra of subdivision-vertex join and subdivision-edge join of two graphs ⋮ Comments to ``The line graphs of lollipop graphs are determined by their spectra ⋮ Some graphs determined by their (signless) Laplacian spectra ⋮ Laplacian spectral characterization of (broken) dandelion graphs ⋮ On the \(A_{\alpha}\)-characteristic polynomial of a graph ⋮ Graphs determined by signless Laplacian spectra ⋮ Which \(Q\)-cospectral graphs have same degree sequences ⋮ Towards a spectral theory of graphs based on the signless Laplacian. II. ⋮ On conjectures involving second largest signless Laplacian eigenvalue of graphs ⋮ Majorization, degree sequence and \(A_\alpha\)-spectral characterization of graphs ⋮ Erratum to ``The lollipop graph is determined by its \(Q\)-spectrum ⋮ On the spectral characterizations of \(\infty \)-graphs ⋮ Proof of conjecture involving the second largest signless Laplacian eigenvalue and the index of graphs ⋮ The signless Laplacian spectral radius of some strongly connected digraphs ⋮ Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphs ⋮ A new arithmetic criterion for graphs being determined by their generalized \(Q\)-spectrum ⋮ Spectral characterization of line graphs of starlike trees ⋮ The characteristic polynomial of generalized lollipop graphs ⋮ Spectral characterizations of signed lollipop graphs ⋮ On the bounds for signless Laplacian energy of a graph

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