Graphs with eigenvalues at least −2

Kumar, Vijaya ; Rao, S. B. ; Singhi, N. M. (1982) Graphs with eigenvalues at least −2 Linear Algebra and its Applications, 46 . pp. 27-42. ISSN 0024-3795

Full text not available from this repository.

Official URL: http://www.sciencedirect.com/science/article/pii/0...

Related URL: http://dx.doi.org/10.1016/0024-3795(82)90023-4

Abstract

The family of minimal forbidden graphs for the set of graphs with all eigenvalues at least −2 is described. It is shown that each minimal forbidden graph has at most 10 vertices and the bound is the best possible.

Item Type:Article
Source:Copyright of this article belongs to Elsevier Science.
ID Code:50437
Deposited On:23 Jul 2011 12:04
Last Modified:23 Jul 2011 12:04

Repository Staff Only: item control page