𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On eigenvalue multiplicity and the girth of a graph

✍ Scribed by P. Rowlinson

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
256 KB
Volume
435
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the girth of infinite graphs
On the girth of infinite graphs
✍ Norbert Seifter πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 599 KB

Let X be an infinite k-valent graph with polynomial growth of degree d, i.e. there is an integer d and a constant c such that fx(n) 3, d> 1, 123, there exist k-valent connected graphs with polynomial growth of degree d and girth greater than 1. This means that in general the girth of graphs with pol

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

On the -optimality in graphs with odd gi
On the -optimality in graphs with odd girth and even girth
✍ C. Balbuena; P. GarcΓ­a-VΓ‘zquez; L.P. Montejano; J. Salas πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 222 KB

## a b s t r a c t For a connected graph G, the restricted edge-connectivity Ξ» β€² (G) is defined as the minimum cardinality of an edge-cut over all edge-cuts S such that there are no isolated vertices in }, d(u) denoting the degree of a vertex u. The main result of this paper is that graphs with od