The lollipop graph is determined by its spectrum
From MaRDI portal
Publication:1010797
zbMATH Open1163.05324arXiv0802.1035MaRDI QIDQ1010797FDOQ1010797
Authors: Romain Boulet, Bertrand Jouve 
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Abstract: An even (resp. odd) lollipop is the coalescence of a cycle of even (resp. odd) length and a path with pendant vertex as distinguished vertex. It is known that the odd lollipop is determined by its spectrum and the question is asked by W. Haemers, X. Liu and Y. Zhang for the even lollipop. We revisit the proof for odd lollipop, generalize it for even lollipop and therefore answer the question. Our proof is essentially based on a method of counting closed walks.
Full work available at URL: https://arxiv.org/abs/0802.1035
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Spectral characterizations of lollipop graphs
- The lollipop graph is determined by its \(Q\)-spectrum
- The line graphs of lollipop graphs are determined by their spectra
- On the (signless) Laplacian spectral characterization of the line graphs of lollipop graphs
- Characterizing properties of permanental polynomials of lollipop graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Enumeration in graph theory (05C30) Paths and cycles (05C38)
Cited In (35)
- Spectral characterizations of sandglass graphs
- Laplacian spectral characterization of some graphs obtained by product operation
- Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
- Spectral characterizations of almost complete graphs
- The spectral characterization of \(\infty\)-graphs
- On the spectral characterization of some unicyclic graphs
- Laplacian spectral characterization of (broken) dandelion graphs
- Characterizing properties of permanental polynomials of lollipop graphs
- Erratum to ``The lollipop graph is determined by its \(Q\)-spectrum
- Laplacian spectral characterization of dumbbell graphs and theta graphs
- Majorization, degree sequence and \(A_\alpha\)-spectral characterization of graphs
- Signless Laplacian spectral characterization of the cones over some regular graphs
- A note on the spectral characterization of dumbbell graphs
- Developments on spectral characterizations of graphs
- Comments to ``The line graphs of lollipop graphs are determined by their spectra
- On the spectral characterization of kite graphs
- The kite graph is determined by its adjacency spectrum
- The spectral characterizations of the connected multicone graphs \(K_w \bigtriangledown L H S\) and \(K_w \bigtriangledown L G Q(3, 9)\)
- The spectral determinations of the join of two friendship graphs
- A note on the spectral characterization of \(\theta \)-graphs
- On the spectral determinations of the connected multicone graphs \(K_r \nabla sK_t\)
- Laplacian spectral characterization of some unicyclic graphs
- On the (signless) Laplacian spectral characterization of the line graphs of lollipop graphs
- Spectral moments of hypertrees and their applications
- The line graphs of lollipop graphs are determined by their spectra
- Spectral characterizations of signed lollipop graphs
- Spectral characterizations of the corona of a cycle and two isolated vertices
- The lollipop graph is determined by its \(Q\)-spectrum
- Note on the spectral characterization of some cubic graphs with maximum number of triangles
- A special class of triple starlike trees characterized by Laplacian spectrum
- Spectral characterization of some cubic graphs
- On the spectral characterizations of \(\infty \)-graphs
- Spectra of signed graphs
- The algebraic connectivity of barbell graphs
- On the \(A_{\alpha}\)-characteristic polynomial of a graph
This page was built for publication: The lollipop graph is determined by its spectrum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010797)
