The lollipop graph is determined by its spectrum

Simple item page
dc.creatorBoulet, Romain
dc.creatorJouve, Bertrand
dc.date2008-02-07
dc.date.accessioned2026-07-07T09:19:18Z
dc.date.available2026-07-07T09:19:18Z
dc.descriptionAn 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.
dc.identifierhttps://arxiv.org/abs/0802.1035
dc.identifierhttp://arxiv.org/abs/0802.1035
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/154342
dc.subjectGeneral Mathematics
dc.subject05C50, 68R10
dc.titleThe lollipop graph is determined by its spectrum
dc.typetext

Files

Collections

arXiv