EMIS ELibM Electronic Journals Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques naturelles / sciences mathematiques
Vol. CXXXI, No. 30, pp. 85–92 (2005)

Previous Article

Next Article

Contents of this Issue

Other Issues

ELibM Journals

ELibM Home

EMIS Home

Pick a mirror

 		 

Signless Laplacians and line graphs

D. Cvetkovic

Faculty of Electrical Engineering, University of Belgrade, P.O.Box 35–54, 11120 Belgrade, Serbia and Montenegro, E-mail: ecvetkod@etf.bg.ac.yu

Abstract: 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

Classification (MSC2000): 05C50

Full text of the article: (for faster download, first choose a mirror)

Electronic fulltext finalized on: 21 Nov 2005. This page was last modified: 20 Jun 2011.

© 2005 Mathematical Institute of the Serbian Academy of Science and Arts
© 2005–2011 FIZ Karlsruhe / Zentralblatt MATH for the EMIS Electronic Edition