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

Abstract A graph with n vertices and minimum degree k ⩾2 can contain no more than (2k−2)n (k 2 −2) cut vertices. This bound is asymptotically tight.

[1]  G. Hopkins,et al.  On the number of cut-vertices in a graph , 1989 .

[2]  Lane H. Clark,et al.  The number of cutvertices in graphs with given minimum degree , 1990, Discret. Math..

[3]  A. R. Rao,et al.  An extremal problem in graph theory , 1968, Journal of the Australian Mathematical Society.