doiSerbia

Signless Laplacians and line graphs

Cvetković Dragoš (Faculty of Electrical Engineering, Belgrade)

The spectrum of a graph is the spectrum of its adjacency 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.

Keywords: graph theory, graph spectra, line graph, signless Laplacian