The Number of Blocks of a Graph with Given Minimum Degree

Abstract

A block of a graph is a nonseparable maximal subgraph of the graph. We denote by bG the number of block of a graph G. We show that, for a connected graph G of order n with minimum degree k≥1, bG<2k−3/k2−k−1n. The bound is asymptotically tight. In addition, for a connected cubic graph G of order n≥14, bG≤n/2−2. The bound is tight.