Spectral extremal problem for the odd prism

From MaRDI portal





One of the central problems of classical extremal graph theory is the Turán-type problem: what is the maximum number of edges of a graph that does not contain fixed forbidden subgraphs? Over the past three decades, a fine-tuned version of this problem has been investigated, namely, the maximum spectral radius of a graph. It is usually referred to as the spectral Turán-type problem.\N\NThis paper determines the maximum spectral radius of a graph with \(n\) vertices and no forbidden subgraph \(C_{2k+1}\Box K_2\) for sufficiently large \(n\). Here \(C_{2k+1}\Box K_2\) is called the odd prism, which is the Cartesian product of graphs \(C_{2k+1}\) and \(K_2\). The paper is a well-written, rigorous contribution to spectral extremal graph theory. Its clear reasoning process, careful algebraic derivations, and novel results on the spectral Turán-type problem make it an important reference resource for researchers in the field of spectral graph theory.











This page was built for publication: Spectral extremal problem for the odd prism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6894383)