EMIS ELibM Electronic Journals PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE (BEOGRAD) (N.S.)
Vol. 51(65), pp. 25--28 (1992)

Previous Article

Next Article

Contents of this Issue

Other Issues

ELibM Journals

ELibM Home

EMIS Home

 		 

On the numbers of positive and negative eigenvalues of a graph

Aleksandar Torgasev

Matematicki fakultet, Beograd, Yugoslavia

Abstract: We consider simple connected graphs with a fixed number of negative eigenvalues (including their multiplicities). We show that these graphs have uniformly bounded numbers of positive eigenvalues, and the last numbers run over a set $[m]=\{1,2,\ldots,m\}$.

Classification (MSC2000): 05C50

Full text of the article:

Electronic fulltext finalized on: 2 Nov 2001. This page was last modified: 16 Nov 2001.

© 2001 Mathematical Institute of the Serbian Academy of Science and Arts
© 2001 ELibM for the EMIS Electronic Edition