Spectral characterizations of lollipop graphs
From MaRDI portal
Publication:924315
DOI10.1016/j.laa.2007.10.018zbMath1226.05156OpenAlexW2028279400MaRDI QIDQ924315
Willem H. Haemers, Yuanping Zhang, Xiaogang Liu
Publication date: 15 May 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2007.10.018
Related Items (49)
Some graphs determined by their spectra ⋮ The spectral characterization of wind-wheel graphs ⋮ Laplacian spectral characterization of dumbbell graphs and theta graphs ⋮ Laplacian spectral characterization of clover graphs ⋮ On the spectral characterization of Kite graphs ⋮ Signless Laplacian spectral characterization of line graphs ofT-shape trees ⋮ On the signless Laplacian spectral determination of the join of regular graphs ⋮ Per-spectral characterizations of some edge-deleted subgraphs of a complete graph ⋮ Spectral determinations and eccentricity matrix of graphs ⋮ On the (signless) Laplacian spectral characterization of the line graphs of lollipop graphs ⋮ Spectral characterization of graphs whose second largest eigenvalue is less than 1 ⋮ Note on the spectral characterization of some cubic graphs with maximum number of triangles ⋮ On the spectral characterization of some unicyclic graphs ⋮ Graphs determined by their generalized characteristic polynomials ⋮ Bipartite graphs with all but two eigenvalues equal to \(0\) and \(\pm 1\) ⋮ 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 ⋮ Laplacian spectral characterization of 3-rose graphs ⋮ The spectral characterization of \(\infty\)-graphs ⋮ Laplacian spectral characterization of some graph products ⋮ Spectra of subdivision-vertex join and subdivision-edge join of two graphs ⋮ THE SPECTRAL DETERMINATIONS OF THE JOIN OF TWO FRIENDSHIP GRAPHS ⋮ Spectral characterization of the complete graph removing a path of small length ⋮ The spectral characterizations of the connected multicone graphs Kw ▽ LHS and Kw ▽ LGQ(3,9) ⋮ Laplacian spectral characterization of disjoint union of paths and cycles ⋮ On the \(A_{\alpha}\)-characteristic polynomial of a graph ⋮ Graphs determined by signless Laplacian spectra ⋮ On the spectral determinations of the connected multicone graphs ⋮ On the spectral characterization of Π-shape trees ⋮ Spectral characterizations of graphs with small spectral radius ⋮ Majorization, degree sequence and \(A_\alpha\)-spectral characterization of graphs ⋮ Spectral characterization of unicyclic graphs whose second largest eigenvalue does not exceed 1 ⋮ On the spectral characterizations of \(\infty \)-graphs ⋮ Which cospectral graphs have same degree sequences ⋮ A note on the spectral characterization of dumbbell graphs ⋮ Developments on spectral characterizations of graphs ⋮ The lollipop graph is determined by its \(Q\)-spectrum ⋮ A note on the spectral characterization of \(\theta \)-graphs ⋮ Spectral characterizations of sandglass graphs ⋮ The kite graph is determined by its adjacency spectrum ⋮ Characterizing properties of permanental polynomials of lollipop graphs ⋮ Spectra of signed graphs ⋮ On the asymptotic behavior of graphs determined by their generalized spectra ⋮ Spectral characterization of line graphs of starlike trees ⋮ Laplacian spectral characterization of some unicyclic graphs ⋮ Spectral characterizations of signed lollipop graphs ⋮ Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
Cites Work
- Unnamed Item
- 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
- 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?
- Minimizing algebraic connectivity over connected graphs with fixed girth
- The complement of the path is determined by its spectrum
- Laplacian spectra and spanning trees of threshold graphs
- On the spectral characterization of T-shape trees
- Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum
This page was built for publication: Spectral characterizations of lollipop graphs
