Prefer a chat interface with context about you and your work?
Signless Laplacians and line graphs
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 …