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

On the number of small cuts in a graph

โœ Scribed by Monika Henzinger; David P. Williamson

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
356 KB
Volume
59
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The number of cut-vertices in a graph of
The number of cut-vertices in a graph of given minimum degree
โœ Michael O. Albertson; David M. Berman ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 228 KB

Albertson, M.O. and D.M. Berman, The number of cut-vertices in a graph of given minimum degree, Discrete Mathematics 89 (1991) 97-100. A graph with n vertices and minimum degree k 2 2 can contain no more than (2k -2)n/(kz -2) cut-vertices. This bound is asymptotically tight. \* Research supported in

On the geodetic number of a graph
On the geodetic number of a graph
โœ Gary Chartrand; Frank Harary; Ping Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 308 KB
On the Cop Number of a Graph
On the Cop Number of a Graph
โœ A. Berarducci; B. Intrigila ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 608 KB
On the separation number of a graph
On the separation number of a graph
โœ Zevi Miller; Dan Pritikin ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 781 KB

We consider the following graph labeling problem, introduced by Leung et al. (3. Y-T. Leung, 0. Vornberger, and J. D. Witthoff, On some variants of the bandwidth minimization problem. SIAM J. Comput. 13 (1984) 650-667). Let G be a graph of order n, and f a bijection from the separation number of G,

On the bondage number of a graph
On the bondage number of a graph
โœ Yue-Li Wang ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 162 KB

The bondage number b(G) of a graph G is the minimum cardinality of a set of edges of G whose removal from G makes the domination number of G increase. There are several papers discussed the upper bound of b(G). In this paper, we shall give an improved upper bound of b(G).