A block of a graph is a nonseparable maximal subgraph of the graph. We denote by the number of block of a graph . We show that, for a connected graph of order with minimum degree , . The bound is asymptotically tight. In addition, for a connected cubic graph of order , . The bound is tight.

中文翻译：

---

给定最小度的图的块数

图的块是图的不可分离的最大子图。我们用图的块数表示。我们证明，对于最小度阶的连通图， 。边界渐近紧。此外，对于阶的连通立方图， 。界限很紧。