✦ LIBER ✦

On the distribution of eigenvalues of graphs

✍ Scribed by Alexander Kelmans; Xuerong Yong

Book ID: 108316311
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 415 KB
Volume: 199
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00337-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the distribution of the maximum eigen

On the distribution of the maximum eigenvalue of graphs

✍ James B. Shearer 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 235 KB

On the distribution of Laplacian eigenva

On the distribution of Laplacian eigenvalues of a graph

✍ Ji Ming Guo; Xiao Li Wu; Jiong Ming Zhang; Kun Fu Fang 📂 Article 📅 2011 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 186 KB

On the distribution of eigenvalues of a

On the distribution of eigenvalues of a simple undirected graph

✍ Xuerong Yong 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 86 KB

For a simple, undirected graph q n , let k i q n be the ith largest eigenvalue of q n . This paper presents mainly the following: 1. For n P 4, if q n is incomplete, then 2. Seven sucient and necessary conditions such that k 2 q n À1. 3. k 3 q n À1 implies that k j q n À1Y j 3Y 4Y F F F Y n À 1.

The distribution of eigenvalues of graph

The distribution of eigenvalues of graphs

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

On the Eigenvalues of a Graph

✍ H.B. Walikar; H.S. Ramane 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 145 KB

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