The number of blocks of a graph with given minimum degree
From MaRDI portal
Publication:2657452
DOI10.1155/2021/6691960zbMath1465.05084OpenAlexW3123673576MaRDI QIDQ2657452
Publication date: 12 March 2021
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2021/6691960
Cites Work
- Unnamed Item
- Unnamed Item
- On the number of cut-vertices in a graph
- Smallest cubic and quartic graphs with a given number of cutpoints and bridges
- The number of cut-vertices in a graph of given minimum degree
- An extremal problem in graph theory
- New types of topological structures via graphs
- The numbers of cut-vertices and end-blocks in 4-regular graphs
- The number of cut vertices and cut arcs in a strong directed graph