𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximal vertex-connectivity of

✍ Scribed by Eddie Cheng; William A. Lindsey; Daniel E. Steffy

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
172 KB
Volume
46
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Average distance and vertex-connectivity
Average distance and vertex-connectivity
✍ Peter Dankelmann; Simon Mukwembi; Henda C. Swart πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 202 KB

## Abstract The average distance Β΅(__G__) of a connected graph __G__ of order __n__ is the average of the distances between all pairs of vertices of __G__, i.e., $\mu(G)=\left(\_{2}^{n}\right)^{-1}\sum\_{\{x,y\}\subset V(G)}d\_{G} (x,y)$, where __V__(__G__) denotes the vertex set of __G__ and __d_

Maximally connected digraphs
Maximally connected digraphs
✍ J. FΓ brega; M. A. Fiol πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 581 KB

This paper introduces a new parameter / = / ( G ) for a loopless digraph G, which can be thought of as a generalization of the girth of a graph. Let K, A, 6, and D denote respectively the connectivity, arc-connectivity, minimum degree, and diameter of G. Then it is proved that A = 6 if D s 21 and K

On the connectivity of maximal planar gr
On the connectivity of maximal planar graphs
✍ S. L. Hakimi; E. F. Schmeichel πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 254 KB πŸ‘ 1 views
A Static 2-Approximation Algorithm for V
A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity
✍ Monika Rauch Henzinger πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 329 KB

This paper presents insertions-only algorithms for maintaining the exact andror approximate size of the minimum edge cut and the minimum vertex cut of a graph. Ε½ . The algorithms output the approximate or exact size k in time O 1 and a cut of size k in time linear in its size. For the minimum edge