We define the generalized book graph Br,k as the graph constructed by connecting each vertex of Kr to every vertex of an independent set with size k.

In this talk, we determine the graphs with the maximum number of edges and the maximum spectral radius among all non-r-partite Br,k-free graphs of order n, respectively. Some related problems are raised.

余远添，东华理工大学讲师。博士毕业于华中师范大学，博士期间于荷兰蒂尔堡大学进行了为期一年的联合培养。截至目前，在Adv. in Appl. Math.、Electron. J. Combin.、Discrete Math.等期刊发表学术论文十余篇。