๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The minimum augmentation of any graph to a K-edge-connected graph

โœ Scribed by Guo-Ray Cai; Yu-Geng Sun

Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
883 KB
Volume
19
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the edge-connectivity vector of a gra
On the edge-connectivity vector of a graph
โœ Linda M. Lesniak; Raymond E. Pippert ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 202 KB
Hamiltonian properties of the cube of a
Hamiltonian properties of the cube of a 2-edge connected graph
โœ M. Paoli ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 514 KB

Let G be a 2-edge connected graph with a t least 5 vertices. For any given vertices a, b, c, and din G with a # b, there exists in G3 a hamiltonian path with endpoints a and b avoiding the edge cd, and there exists in G3 U {cd} a hamiltonian path with endpoints a and b and containing the edge cd. Al

A remark on the number of vertices of de
A remark on the number of vertices of degree k in a minimally k-edge-connected graph
โœ Mao-cheng Cai ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 395 KB

Let G be a minimally k-edge-connected simple graph and u\*(G) be the number of vertices of degree k in G. proved that (i) uk(G) 2 l(jGl -1)/(2k + l)] + k + 1 for even k, and (ii) uI(G) 2 [lGl/(k + l)] + k for odd k 35 and u,(G) 2 lZlGl/(k + l)] + k -2 for odd k 27, where ICI denotes the number of v