Spectral characterizations of lollipop graphs
From MaRDI portal
Recommendations
- On the (signless) Laplacian spectral characterization of the line graphs of lollipop graphs
- The characteristic polynomial of generalized lollipop graphs
- On the spectral characterizations of graphs
- Characterizing properties of permanental polynomials of lollipop graphs
- scientific article; zbMATH DE number 867649
- A survey on spectral characterizations of graphs
- Diagonalization of generalized lollipop graphs
- Comments to ``The line graphs of lollipop graphs are determined by their spectra
- Spectral characterizations of propeller graphs
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- A certain polynomial of a graph and graphs with an extremal number of trees
- Constructing cospectral graphs
- Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum
- Laplacian spectra and spanning trees of threshold graphs
- Minimizing algebraic connectivity over connected graphs with fixed girth
- On the Laplacian eigenvalues of a graph
- On the spectral characterization of T-shape trees
- Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
- Starlike trees are determined by their Laplacian spectrum
- The \(T\)-shape tree is determined by its Laplacian spectrum
- The complement of the path is determined by its spectrum
- Which graphs are determined by their spectrum?
Cited in
(57)- Bipartite graphs with all but two eigenvalues equal to \(0\) and \(\pm 1\)
- The algebraic connectivity of barbell graphs
- scientific article; zbMATH DE number 5590101 (Why is no real title available?)
- On the signless Laplacian spectral determination of the join of regular graphs
- The spectral determinations of the join of two friendship graphs
- Spectral characterizations of sandglass graphs
- A note on the spectral characterization of \(\theta \)-graphs
- The algebraic connectivity of lollipop graphs
- On the spectral characterization of \(\Pi\)-shape trees
- Note on the spectral characterization of some cubic graphs with maximum number of triangles
- The characteristic polynomial of generalized lollipop graphs
- On the spectral characterization of kite graphs
- Majorization, degree sequence and \(A_\alpha\)-spectral characterization of graphs
- Which cospectral graphs have same degree sequences
- Spectral characterizations of graphs with small spectral radius
- The kite graph is determined by its adjacency spectrum
- On the spectral determinations of the connected multicone graphs \(K_r \nabla sK_t\)
- The spectral characterization of \(\infty\)-graphs
- Some graphs determined by their spectra
- Graphs determined by their generalized characteristic polynomials
- On the (signless) Laplacian spectral characterization of the line graphs of lollipop graphs
- Spectral characterization of the complete graph removing a path of small length
- scientific article; zbMATH DE number 1436000 (Why is no real title available?)
- Signless Laplacian spectral characterization of the cones over some regular graphs
- A note on the spectral characterization of dumbbell graphs
- Spectral characterizations of signed lollipop graphs
- On the spectral characterization of some unicyclic graphs
- Spectra of signed graphs
- Spectral characterization of graphs whose second largest eigenvalue is less than 1
- On the asymptotic behavior of graphs determined by their generalized spectra
- Laplacian spectral characterization of disjoint union of paths and cycles
- Spectral characterization of unicyclic graphs whose second largest eigenvalue does not exceed 1
- The lollipop graph is determined by its \(Q\)-spectrum
- Graphs determined by signless Laplacian spectra
- On the spectral characterizations of \(\infty \)-graphs
- Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
- Spectral determinations and eccentricity matrix of graphs
- Characterizing properties of permanental polynomials of lollipop graphs
- On the spectral characterization of pineapple graphs
- The line graphs of lollipop graphs are determined by their spectra
- The spectral characterization of wind-wheel graphs
- Signless Laplacian spectral characterization of line graphs of \(T\)-shape trees
- Laplacian spectral characterization of some graph products
- Laplacian spectral characterization of 3-rose graphs
- Laplacian spectral characterization of some unicyclic graphs
- Developments on spectral characterizations of graphs
- The spectral characterizations of the connected multicone graphs \(K_w \bigtriangledown L H S\) and \(K_w \bigtriangledown L G Q(3, 9)\)
- Laplacian spectral characterization of some graphs obtained by product operation
- Algebraic connectivity of lollipop graphs: a new approach
- Laplacian spectral characterization of dumbbell graphs and theta graphs
- On the \(A_{\alpha}\)-characteristic polynomial of a graph
- Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
- Spectral characterization of line graphs of starlike trees
- Spectra of subdivision-vertex join and subdivision-edge join of two graphs
- The lollipop graph is determined by its spectrum
- Comments to ``The line graphs of lollipop graphs are determined by their spectra
- Laplacian spectral characterization of clover graphs
This page was built for publication: Spectral characterizations of lollipop graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q924315)