𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Algebraic Connectivity of Graphs with Given Matching Number

✍ Scribed by Bao-Xuan Zhu

Book ID
120788748
Publisher
Springer Japan
Year
2012
Tongue
English
Weight
227 KB
Volume
29
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On connectivity in graphs with given cli
On connectivity in graphs with given clique number
✍ Angelika Hellwig; Lutz Volkmann πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 82 KB πŸ‘ 1 views

## Abstract We consider finite, undirected, and simple graphs __G__ of order __n__(__G__) and minimum degree Ξ΄(__G__). The connectivity ΞΊ(__G__) for a connected graph __G__ is defined as the minimum cardinality over all vertex‐cuts. If ΞΊ(__G__) < δ(__G__), then Topp and Volkmann 7 showed in 1993 f

On local connectivity of graphs with giv
On local connectivity of graphs with given clique number
✍ Andreas Holtkamp; Lutz Volkmann πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 72 KB

## Abstract For a vertex __v__ of a graph __G__, we denote by __d__(__v__) the __degree__ of __v__. The __local connectivity__ ΞΊ(__u, v__) of two vertices __u__ and __v__ in a graph __G__ is the maximum number of internally disjoint __u__ –__v__ paths in __G__, and the __connectivity__ of __G__ is