An extremal problem on Q-spectral radii of graphs with given size and matching number
An extremal problem on Q-spectral radii of graphs with given size and matching number
复制标题
DOI：
10.1080/03081087.2021.1915231
复制
发表时间：
2021-04
影响因子：
1.1
通讯作者：
M. Zhai;Jie Xue;Ruifang Liu
中科院分区：
文献类型：
--
作者：
M. Zhai;Jie Xue;Ruifang Liu
Brualdi和Hoffman[关于(0，1)-矩阵的谱半径。线性代数应用。1985；65：133-146]提出了确定给定尺寸图的最大谱半径的问题。本文研究了具有给定匹配数的图的Brualdi-Hoffman型问题。给出了给定尺寸和匹配个数的图的最大q-谱半径，并完全确定了相应的极图。
Brualdi and Hoffman [On the spectral radius of (0, 1)-matrices. Linear Algebra Appl. 1985;65:133–146] proposed the problem of determining the maximal spectral radius of graphs with a given size. In this paper, we consider the Brualdi–Hoffman-type problem for graphs with a given matching number. The maximal Q-spectral radius of graphs with a given size and matching number is obtained, and the corresponding extremal graphs are completely determined.