The Number of Blocks of a Graph with Given Minimum Degree

[摘要] 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.

[学科分类] 安全、风险、质量和可靠性