On the spectral radius of block graphs having all their blocks of the same size (Q2052182)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the spectral radius of block graphs having all their blocks of the same size |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the spectral radius of block graphs having all their blocks of the same size |
scientific article |
Statements
On the spectral radius of block graphs having all their blocks of the same size (English)
0 references
25 November 2021
0 references
In this article, the authors consider the class of block graphs having all their blocks of the same size (\(\geq 3\)) and the bounds for the spectral radius established by \textit {L. Lovász} and \textit {J. Pelikan} [Period. Math. Hung. 3, 175--182 (1973; Zbl 0247.05108)]. In such class, the unique graph that reaches the minimum spectral radius in the case where the graph has at most three pairwise adjacent cut vertices is provided. Additional bounds are discussed.
0 references
block graphs
0 references
spectral radius of a graph
0 references
0 references
