𝔖 Bobbio Scriptorium
✦   LIBER   ✦

GRAPHS WITH A SMALL NUMBER OF DISTINCT EIGENVALUES

✍ Scribed by Michael Doob

Book ID
114879171
Publisher
John Wiley and Sons
Year
1970
Tongue
English
Weight
306 KB
Volume
175
Category
Article
ISSN
0890-6564

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Graphs with a small number of distinct i
Graphs with a small number of distinct induced subgraphs
✍ Noga Alon; BΓ©la BollobΓ‘s πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 514 KB

Let G be a graph on n vertices. We show that if the total number of isomorphism types of induced subgraphs of G is at most &II', where E < lo-\*', then either G or its complement contain an independent set on at least (1 -4e)n vertices. This settles a problem of Erdiis and Hajnal.

On graphs with a fixed number of negativ
On graphs with a fixed number of negative eigenvalues
✍ Aleksander TorgaΕ‘ev πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 374 KB

Let P(n) be the class of all connected graphs having exactly n ~> 1 negative eigenvalues (including their multiplicities). In this paper we prove that the class P(n) contains only finitely many so-called canonical graphs. The analogous statement for the class Q(n) of all connected graphs having exac