✦ LIBER ✦

The distribution of eigenvalues of graphs

✍ Scribed by Dasong Cao; Hong Yuan

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 846 KB
Volume: 216
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(93)00135-m

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The expected eigenvalue distribution of

The expected eigenvalue distribution of a large regular graph

✍ Brendan D. McKay 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 642 KB

Eigenvalues of finite graphs

✍ C. Delorme 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 642 KB

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.

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

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