Xiao-Bing Luo

Spectral Extrema of Bipartite Graphs: Forbidden an Even Cycle of Specified Length

A graph is called H-free if the graph has no subgraph being isomorphic to H. The classical Turán problem aims to determine the maximum size of an H-free graph with given order. In 2010, Nikiforov introduced the spectral Turán-type problem: determine the maximum spectral radius of an H-free graph with given order. He al...