EMIS ELibM Electronic Journals PUBLICATIONS DE L'INSTITUT MATHEMATIQUE (BEOGRAD) (N.S.)
Vol. 78(92), pp. 51–63 (2005)

Previous Article

Next Article

Contents of this Issue

Other Issues


ELibM Journals

ELibM Home

EMIS Home


Pick a mirror

 

COSPECTRAL GRAPHS WITH LEAST EIGENVALUE AT LEAST $-2$

Dragos Cvetkoviand Mirko Lepovic

Elektrotehnicki fakultet, Beograd, Serbia and Montenegro and Prirodno-matematicki fakultet, Kragujevac, Serbia and Montenegro

Abstract: We study the phenomenon of cospectrality in generalized line graphs and in exceptional graphs. We survey old results from today's point of view and obtain some new results partly by the use of computer. Among other things, we show that a connected generalized line graph $L(H)$ has an exceptional cospectral mate only if its root graph $H$, assuming it is itself connected, has at most 9 vertices. The paper contains a description of a table of sets of cospectral graphs with least eigenvalue at least $-2$ and at most 8 vertices together with some comments and theoretical explanations of the phenomena suggested by the table.

Classification (MSC2000): 05C50

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


Electronic fulltext finalized on: 2 Mar 2006. This page was last modified: 27 Oct 2006.

© 2006 Mathematical Institute of the Serbian Academy of Science and Arts
© 2006 ELibM and FIZ Karlsruhe / Zentralblatt MATH for the EMIS Electronic Edition