𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A lower bound for algebraic connectivity based on the connection-graph-stability method

✍ Scribed by Ali Ajdari Rad; Mahdi Jalili; Martin Hasler

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

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A lower bound on connectivities of matro
A lower bound on connectivities of matroid base graphs
✍ Guizhen Liu πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 853 KB

The connectivity of a graph G and the corank of a matroid M are denoted by K(G) and p, respectively. X is shown that if a graph G is the base graph of a simple mat&d M, then K(G) L 2p and the lower bound of 2p izA best possible.

Bounds on the average connectivity of a
Bounds on the average connectivity of a graph
✍ Peter Dankelmann; Ortrud R. Oellermann πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 235 KB

In this paper, we consider the concept of the average connectivity of a graph, deΓΏned to be the average, over all pairs of vertices, of the maximum number of internally disjoint paths connecting these vertices. We establish sharp bounds for this parameter in terms of the average degree and improve o

Tight bounds on the chromatic sum of a c
Tight bounds on the chromatic sum of a connected graph
✍ Carsten Thomassen; Paul ErdΓΆs; Yousef Alavi; Paresh J. Malde; Allen J. Schwenk πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 236 KB πŸ‘ 1 views