𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The number of cut-vertices in a graph of given minimum degree

✍ Scribed by Michael O. Albertson; David M. Berman

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
228 KB
Volume
89
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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 part by NSF DMS 85 13418. ** Research conducted while a visiting scholar at Smith College.

πŸ“œ SIMILAR VOLUMES

On the number of vertices of given degre
On the number of vertices of given degree in a random graph
✍ Zbigniew Palka πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 115 KB πŸ‘ 1 views

This note can be treated a s a supplement to a paper written by Bollobas which was devoted to the vertices of a given degree in a random graph. We determine some values of the edge probability p for which the number of vertices of a given degree of a random graph G E ?An, p) asymptotically has a nor

Vertices of given degree in a random gra
Vertices of given degree in a random graph
✍ BΓ©la BollobΓ‘s πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 349 KB πŸ‘ 1 views
The number of cutvertices in graphs with
The number of cutvertices in graphs with given minimum degree
✍ L.H. Clark; R.C. Entringer πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 453 KB

The maximum number of cutvertices in a connected graph of order n having minimum degree at least 6 is determined for 6 > 5.

Enumeration of digraphs with given numbe
Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree
✍ Shinsei Tazawa; Teruhiro Shirakura; Saburo Tamura πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 609 KB

## Tazawa, S., T. Shirakura and S. Tamura, Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree, Discrete Mathematics 90 (1991) 63-74. In a digraph, a vertex of odd out(in)-degree is called an odd out(in)-vertex. This paper will give the ordinary g