34 citations · 63 across the 21 of their papers we have counts for
22 papers
The minimum spectral radius of maximal outerplanar graphs
Suil O
An outerplanar graph is \emph{maximal} if no edge can be added without losing outerplanarity. Lin and Ning determined the outerplanar graph with the largest spectral radius, and th…
Exact local spectral thresholds for perfect matchings in -graphs and -partite -graphs
Pei Liu, Suil O
For a -uniform hypergraph , let be the minimum over the vertices of of the spectral radius of the link. Lin, Lu, Yuan and Zhao conjectured that $σ(H)>\tfrac{2n}3-2…
The maximum spectral radius of uniform hypergraphs whose shadow excludes a complete or complete bipartite minor
Pei Liu, Suil O
For a -uniform hypergraph , the shadow of is the graph whose edges are the pairs covered by a hyperedge. In this paper, for all sufficiently large ,…
The maximum spectral radius of outerplanar and planar -uniform hypergraphs
Pei Liu, Suil O
For an integer , a -angulation is a simple -connected outerplane graph whose interior faces are bounded by -cycles, and a closed -angulation is a simple -conn…
A sharp Randić bound for König--Egerváry graphs and a conjecture of Aouchiche, Hansen, and Zheng
Pei Liu, Feiyu Nan, Suil O +1
Let be the matching number of a graph , and let its Randić index be . In 2006, Aouchiche, Hansen, and Zheng conjectured that the…
A reduction principle for non--partite spectral extremal problems, with a complete multipartite classification
Suil O, Jiadong Wu
A graph is non--partite if its chromatic number exceeds . For an edge-color-critical graph with , let be the maximum adjacency spectr…