3 papers
math.CO2024
Extremal spectral results of planar graphs without or graph
HaoRan Zhang, WenHuan Wang
Let be a given family of graphs. A graph is -free if it does not contain any member of as a subgraph. Let be a graph obta…
math.CO2023
The upper bound of the spectral radius for the hypergraphs without Berge-graphs
Wen-Huan Wang, Lou-Jun Yu
The spectral analogue of the Turán type problem for hypergraphs is to determine the maximum spectral radius for the hypergraphs of order that do not contain a given hypergraph.…
math.CO2023
A stability result for Berge- -graphs and its applications
Junpeng Zhou, Xiying Yuan, Wen-Huan Wang
An -uniform hypergraph (-graph) is linear if any two edges intersect at most one vertex. For a graph , a hypergraph is Berge- if there is a bijection $ϕ:E(F)\righta…