An extremal problem on <i>Q</i>-spectral radii of graphs with given size and matching number
Mingqing Zhai, Jie Xue, Ruifang Liu
Abstract
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.
Topics & Concepts
Spectral radiusMathematicsMatching (statistics)CombinatoricsRADIUSDiscrete mathematicsComputer sciencePhysicsStatisticsEigenvalues and eigenvectorsQuantum mechanicsComputer securityGraph theory and applicationsMatrix Theory and AlgorithmsAdvanced Graph Theory Research