✦ LIBER ✦

Eigenvalues of finite graphs

✍ Scribed by C. Delorme

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 642 KB
Volume: 114
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90362-w

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds of eigenvalues of graphs

✍ Yuan Hong 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 469 KB

The eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents an algebraically defined invariant system of a graph. We get some bounds of the eigenvalues of graphs and propose a few open problems.

The distribution of eigenvalues of graph

The distribution of eigenvalues of graphs

✍ Dasong Cao; Hong Yuan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 846 KB

Eigenvalues of matrices with tree graphs

✍ Clark Jeffries; P. van den Driessche 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 827 KB

Hamilton cycles and eigenvalues of graph

Hamilton cycles and eigenvalues of graphs

✍ J. van den Heuvel 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 427 KB

Nonregular Graphs with Three Eigenvalues

✍ Edwin R. van Dam 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 387 KB

We study nonregular graphs with three eigenvalues. We determine all the ones with least eigenvalue &2, and give new infinite families of examples. 1998 Academic Press ## 1. Introduction In this paper we look at the graphs that are generalizations of strongly regular graphs (cf. [3, 6, 16]) by drop

On the embedding of graphs into graphs w

On the embedding of graphs into graphs with few eigenvalues

✍ Vu, Van H. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 726 KB

A graph is called of type k if it is connected, regular, and has k distinct eigenvalues. For example graphs of type 2 are the complete graphs, while those of type 3 are the strongly regular graphs. We prove that for any positive integer n, every graph can be embedded in n cospectral, non-isomorphic