𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the distribution of eigenvalues of a simple undirected graph

✍ Scribed by Xuerong Yong

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
86 KB
Volume
295
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis

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

  1. Seven sucient and necessary conditions such that k 2 q n Γ€1.

  2. k 3 q n Γ€1 implies that k j q n Γ€1Y j 3Y 4Y F F F Y n Γ€ 1.

πŸ“œ SIMILAR VOLUMES

On the Eigenvalues of a Graph
On the Eigenvalues of a Graph
✍ H.B. Walikar; H.S. Ramane πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 145 KB
On the Laplacian eigenvalues of a graph
On the Laplacian eigenvalues of a graph
✍ Jiong-Sheng Li; Xiao-Dong Zhang πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 148 KB

In the note, we present an upper bound for the spectral radius of Laplacian matrix of a graph in terms of a "2-degree" of a vertex.

On the second eigenvalue of a graph
On the second eigenvalue of a graph
✍ A. Nilli πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 241 KB

Nilli, A., On the second eigenvalue of a graph, Discrete Mathematics 91 (1991) 207-210. It is shown that the second largest eigenvalue of the adjacency matrix of any G containing two edges the distance between which is at least 2k + 2 is at least (2G -l)/(k + 1).

A note on k-strongly connected orientati
A note on k-strongly connected orientations of an undirected graph
✍ AndrΓ‘s Frank πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 168 KB

Each k-strongly connected orientation of an undirect:7d I.&P A \_an be obtained from any other k-strongly connected orientation by reversing consec aLir :!I 3irected paths or circuits without destroying the k-strong connectivity.