当前位置: X-MOL 学术Discret. Dyn. Nat. Soc. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
The Number of Blocks of a Graph with Given Minimum Degree
Discrete Dynamics in Nature and Society ( IF 1.3 ) Pub Date : 2021-01-25 , DOI: 10.1155/2021/6691960
Lei Li 1 , Baoyindureng Wu 1
Affiliation  

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.

中文翻译:

给定最小度的图的块数

图的块是图的不可分离的最大子图。我们用图的块数表示我们证明,对于最小度阶的连通图 边界渐近紧。此外,对于阶的连通立方图 界限很紧。
更新日期:2021-01-25
down
wechat
bug