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

The number of cutvertices in graphs with given minimum degree

โœ Scribed by L.H. Clark; R.C. Entringer

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
453 KB
Volume
81
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

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

๐Ÿ“œ 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 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

The maximum interval number of graphs wi
The maximum interval number of graphs with given genus
โœ Edward R. Scheinerman ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 202 KB ๐Ÿ‘ 1 views

The interval number of a graph G, denoted i(G), is the least positive integer t such that G is the intersection graph of sets, each of which is the union of t compact real intervals. It is known that every planar graph has interval number at most 3 and that this result is best possible. We investiga