A spectral extremal problem on graphs with given size and matching number
Combinatorics
2020-07-07 v1
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 -spectral radius of graphs with given size and matching number is obtained, and the corresponding extremal graphs are also determined.
Keywords
Cite
@article{arxiv.2007.02008,
title = {A spectral extremal problem on graphs with given size and matching number},
author = {Mingqing Zhai and Jie Xue and Ruifang Liu},
journal= {arXiv preprint arXiv:2007.02008},
year = {2020}
}