1 paper
Weilun Xu, An Chang
Given a graph F, let SPEXP(n,F) be the set of graphs with the maximum spectral radius among all F-free n-vertex planner graph. In 2017, Tait and Tobin proved that for suff…