Geodesic
The lollipop graph is determined by its spectrum
The electronic journal of combinatorics, Tome 15 (2008)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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. A private communication of Behruz Tayfeh-Rezaie pointed out that an even lollipop with a cycle of length at least $6$ is determined by its spectrum but the result for lollipops with a cycle of length $4$ is still unknown. We give an unified proof for lollipops with a cycle of length not equal to $4$, generalize it for lollipops with a cycle of length $4$ and therefore answer the question. Our proof is essentially based on a method of counting closed walks.
DOI : 10.37236/798
Classification : 05C50, 05C30, 05C38
Mots-clés : lollipop graph, cycle of even length, path with pendant vertex, graph spectrum 
@article{10_37236_798,
     author = {R. Boulet and B. Jouve},
     title = {The lollipop graph is determined by its spectrum},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/798},
     zbl = {1163.05324},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/798/}
}
TY  - JOUR
AU  - R. Boulet
AU  - B. Jouve
TI  - The lollipop graph is determined by its spectrum
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/798/
DO  - 10.37236/798
ID  - 10_37236_798
ER  - 
%0 Journal Article
%A R. Boulet
%A B. Jouve
%T The lollipop graph is determined by its spectrum
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/798/
%R 10.37236/798
%F 10_37236_798
R. Boulet; B. Jouve. The lollipop graph is determined by its spectrum. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/798

Cité par Sources :