Given a graph H, a graph is said to be H-free if it does not contain H as a subgraph. A graph is color-critical when it has an edge whose removal leads to a reduction in its chromatic number. For a graph H with a chromatic number of \ (r + 1\), we use \ (spexₑ + ₁ (n, H) \) to represent the maximum spectral radius among non-r-partite H-free graphs of order n. The set of all non-r-partite H-free graphs of order n that have a spectral radius of \ (spexₑ + ₁ (n, H) \) is denoted as \ (SPEXₑ + ₁ (n, H) \). For \ (r2\) and \ (k1\), we define \ (Bₑ, ₊\) as the graph constructed by connecting each vertex of \ (Kᵣ\) to every vertex of an independent set with size k. We refer to \ (Bₑ, ₊\) as a book graph (in the case of \ (r = 2\) ) or a generalized book graph (when \ (r3\) ). It should be noted that \ (Bₑ, ₊\) is a color-critical graph with a chromatic number of \ (r + 1\). Lin, Ning, and Wu (2021) identified the unique extremal graph within \ (SPEX₃ (n, B₂, ₁) \) ; Li and Peng (2023) determined the unique extremal graph in \ (SPEXₑ + ₁ (n, Bₑ, ₁) \) for all \ (r2\). Quite recently, Liu and Miao (2025) specified the unique extremal graph in \ (SPEX₃ (n, B₂, ₊) \) for all \ (k2\). Inspired by these remarkable results, this paper, relying on spectral stability theory, local structure characterization, along with the theory of characteristic equations and Rayleigh quotient equations, aims to determine the unique extremal graph in \ (SPEXₑ + ₁ (n, Bₑ, ₊) \) for \ (r3\), \ (k1\), and sufficiently large n. This work partially addresses an open problem put forward in 38.
Yu et al. (Sat,) studied this question.