Signless Laplacians and line graphs. (English) Zbl 1119.05066

The spectrum of a graph is the spectrum of its adjacency matrix. The author studies the phenomenon of cospectrality in graphs by comparing characterizing properties of spectra of graphs and spectra of their line graphs. In this comparison spectra of signless Laplacians of graphs are used.


05C50 Graphs and linear algebra (matrices, eigenvalues, etc.)
Full Text: DOI EuDML