arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.08023math.SPmath.CO
收藏

On the spectral radius of block graphs having all their blocks of the same size

Cristian M. Conde, Ezequiel Dratman, Luciano N. Grippo

英文摘要:

Let $\mathcal{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\in \mathcal{B}(n,q)$ has at most three pairwise adjacent cut vertices then the minimum spectral radius $ρ(G)$ is attained at a unique graph. In addition, we present a lower bound for $ρ(G)$ when $G\in \mathcal{B}(n,q)$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑