Signless Laplacians and line graphs
Bulletin de l'Académie serbe des sciences. Classe des sciences mathématiques et naturelles, Tome 30 (2005) no. 1
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
The spectrum of a graph is the spectrum of
its ađacency matrix. Cospectral graphs are graphs having the
same spectrum. In this paper we study the phenomenon of
cospectrality in graphs by comparing characterizing properties of
spectra of graphs and spectra of their line graphs. We present
some arguments showing that the latter perform better. In this
comparison we use spectra of signless Laplacians of graphs.
@article{BASS_2005_30_1_a6,
author = {D. Cvetkovi\'c},
title = {Signless {Laplacians} and line graphs},
journal = {Bulletin de l'Acad\'emie serbe des sciences. Classe des sciences math\'ematiques et naturelles},
pages = {85 - 92},
year = {2005},
volume = {30},
number = {1},
zbl = {1119.05066},
url = {http://geodesic.mathdoc.fr/item/BASS_2005_30_1_a6/}
}
D. Cvetković. Signless Laplacians and line graphs. Bulletin de l'Académie serbe des sciences. Classe des sciences mathématiques et naturelles, Tome 30 (2005) no. 1. http://geodesic.mathdoc.fr/item/BASS_2005_30_1_a6/