A spectral extremal problem on graphs with given size and matching number

2020/07/04 by Zhai, Mingqing, Xue, Jie, Liu, Ruifang
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2007.02008

Abstract

Brualdi and Hoffman (1985) proposed the problem of determining the maximal spectral radius of graphs with given size. In this paper, we consider the Brualdi-Hoffman type problem of graphs with given matching number. The maximal Q-spectral radius of graphs with given size and matching number is obtained, and the corresponding extremal graphs are also determined.

Related

• Extremal distance spectral radius of graphs with fixed size
• Extremal graphs for the maximum A_α-spectral radius of graphs with order and size
• Two spectral extremal results for graphs with given order and rank
• On the maximal α-spectral radius of graphs with given matching number
• A survey of edge-spectral-Turán type problems in spectral graph theory: Results, conjectures and open problems