works on
connected graphs 1extremal graphs 1lower bounds 1matching number 1spectral graph theory 1

From the 1 of 2 linked papers with an AI index.

collaborators

2 papers

math.CO2026

Tight lower bound for the spectral radius of connected graphs with given matching number

Xinmin Hou, Li Tan

The paper establishes a tight lower bound for the spectral radius of connected graphs with a given matching number and characterizes the extremal graphs when the matching number di…

math.CO2025

Generalized Turán problem with bounded matching number

Yue Ma, Xinmin Hou

For a graph and a set of graphs , let $\mbox{ex}(n,T,\mathcal{H})$ denote the maximum number of copies of in an -vertex -free graph. Recently,…