The Number of Blocks of a Graph with Given Minimum Degree

Lei Li, Baoyindureng Wu and A. E. Matouk

Discrete Dynamics in Nature and Society, 2021, vol. 2021, 1-5

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

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/ddns/2021/6691960.pdf (application/pdf)
http://downloads.hindawi.com/journals/ddns/2021/6691960.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnddns:6691960

DOI: 10.1155/2021/6691960

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().