Starlike trees with maximum degree 4 are determined by their signless Laplacian spectra
ELA. The Electronic Journal of Linear Algebra, Tome 20 (2010), pp. 274-290.

Voir la notice de l'article dans Electronic Library of Mathematics

Summary: A graph is said to be determined by its signless Laplacian spectrum if there is no other non-isomorphic graph with the same spectrum. In this paper, it is shown that each starlike tree with maximum degree 4 is determined by its signless Laplacian spectrum.
Classification : 05C50
Mots-clés : starlike trees, spectra of graphs, cospectral graphs 
@article{EEJLA_2010__20__a34,
     author = {Omidi, Gholam R. and Vatandoost, Ebrahim},
     title = {Starlike trees with maximum degree 4 are determined by their signless {Laplacian} spectra},
     journal = {ELA. The Electronic Journal of Linear Algebra},
     pages = {274--290},
     publisher = {mathdoc},
     volume = {20},
     year = {2010},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/item/EEJLA_2010__20__a34/}
}
TY  - JOUR
AU  - Omidi, Gholam R.
AU  - Vatandoost, Ebrahim
TI  - Starlike trees with maximum degree 4 are determined by their signless Laplacian spectra
JO  - ELA. The Electronic Journal of Linear Algebra
PY  - 2010
SP  - 274
EP  - 290
VL  - 20
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/EEJLA_2010__20__a34/
LA  - en
ID  - EEJLA_2010__20__a34
ER  - 
%0 Journal Article
%A Omidi, Gholam R.
%A Vatandoost, Ebrahim
%T Starlike trees with maximum degree 4 are determined by their signless Laplacian spectra
%J ELA. The Electronic Journal of Linear Algebra
%D 2010
%P 274-290
%V 20
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/EEJLA_2010__20__a34/
%G en
%F EEJLA_2010__20__a34
Omidi, Gholam R.; Vatandoost, Ebrahim. Starlike trees with maximum degree 4 are determined by their signless Laplacian spectra. ELA. The Electronic Journal of Linear Algebra, Tome 20 (2010), pp. 274-290. https://geodesic-test.mathdoc.fr/item/EEJLA_2010__20__a34/