From the 1 of 4 linked papers with an AI index.
4 papers
Spectral extremal problems on planar and outerplanar graphs without $C_{k,l}
Jiamin Li, Dan Li, Xilong Yin +1
The paper determines the maximum spectral radius and the unique extremal planar and outerplanar graphs that avoid the graph C_{k,l} (two cycles sharing a vertex) for all large n.
Krahn--SzegÅ type inequalities and nodal domain methods on graphs
Huiqiu Lin, Lianping Liu, Xilong Yin +1
We study discrete analogues of classical spectral geometric inequalities and extremal eigenvalue problems on graphs. The classical Krahn--SzegÅ inequality states that, among bound…
Planar and Outerplanar Spectral Extremal Problems based on Paths
Xilong Yin, Dan Li, Jixiang Meng
Let SPEX and SPEX denote the sets of graphs with the maximum spectral radius over all -vertex -free planar and outerplanar graphs, resp…
Spectral extremal problems on outerplanar and planar graphs
Xilong Yin, Dan Li
Let and be the maximum spectral radius over all -vertex -free outerplanar graphs and planar graphs, respect…