文献类型：期刊文献

英文题名：The extremal spectral radius of generalized block graphs

作者：Ji, Xue[1];Guo, Ji -Ming[1];Wang, Zhiwen[1]

机构：[1]East China Univ Sci & Technol, Sch Math, Shanghai, Peoples R China

年份：2024

卷号：680

起止页码：239

外文期刊名：LINEAR ALGEBRA AND ITS APPLICATIONS

收录：;EI(收录号：20234314936329);WOS:【SCI-EXPANDED(收录号:WOS:001108641000001)】；

基金：This work is supported by NSFC (Nos. 11371372 , 12301438).

语种：英文

外文关键词：Block graphs; Generalized block graphs; Spectral radius

摘要：A block graph is a graph in which every block is a complete graph. Denote by Kn,q the set of block graphs with n vertices and all blocks on q+1 vertices for every q >= 2. Recently, Zhao and Liu (2023) determined the minimum spectral radius of graphs in Kn,q, which verified a conjecture posed by Conde et al. (2022). Replacing the complete graph by a general block or a cycle, we define a generalized block graph or a cycle tree, respectively. Let Bn,q (resp. Cn,q) be the set of generalized block graphs (resp. cycle trees) on n vertices and in which each block is of order q + 1 for q >= 2. In this paper, we obtain the maximum/minimum spectral radius of a graph in Cn,q. Furthermore, we determine the extremal graph attaining the minimum spectral radius among graphs in Bn,q, which coincides with that in Cn,q. (c) 2023 Elsevier Inc. All rights reserved.