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 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...

Full description

Bibliographic Details
Main Authors: Lei Li, Baoyindureng Wu
Format: Article
Language:English
Published: Hindawi Limited 2021-01-01
Series:Discrete Dynamics in Nature and Society
Online Access:http://dx.doi.org/10.1155/2021/6691960