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

preprint2020arXivOpen access

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 QQ-spectral radius of graphs with given size and matching number is obtained, and the corresponding extremal graphs are also determined.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.