𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The expected eigenvalue distribution of a large regular graph

✍ Scribed by Brendan D. McKay

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
642 KB
Volume
40
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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).

The matching polynomial of a regular gra
The matching polynomial of a regular graph
✍ Robert A. Beezer; E.J. Farrell πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 588 KB

The matching polynomial of a graph has coefficients that give the number ofmatchings in the graph. For a regular graph, we show it is possible to recover the order, degree, girth and number of minimal cycles from the matching polynomial. If a graph is characterized by its matching polynomial, then i

On the bipartite density of regular grap
On the bipartite density of regular graphs with large girth
✍ OndΕ™ej ZΓ½ka πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 154 KB πŸ‘ 1 views

## Abstract Let __B(G)__ be the edge set of a bipartite subgraph of a graph __G__ with the maximum number of edges. Let __b~k~__ = inf{|__B(G)__|/|__E(G)__β€–__G__ is a cubic graph with girth at least __k__}. We will prove that lim~k β†’ ∞~ __b~k~__ β‰₯ 6/7.