首页|On the spectral radius of block graphs having all their blocks of the same size
On the spectral radius of block graphs having all their blocks of the same size
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
Let B(n, q) be the class of block graphs on n vertices having all their blocks of the same size. We prove that if G is an element of B(n, q) has at most three pairwise adjacent cut vertices then the minimum spectral radius rho(G) is attained at a unique graph. In addition, we present a lower bound for rho(G) when G is an element of B(n, q). (C) 2021 Elsevier Inc. All rights reserved.
Block graphsSpectral radius of a graphCONNECTIVITY
Conde, Cristian M.、Dratman, Ezequiel、Grippo, Luciano N.
NSTL
Elsevier
