题目：The signless Laplacian spectral radius of graphs forbidden linear forests
摘要：Turán-type extremal problem asks to maximize the number of edges over all graphs which do not contain fixed forbidden subgraphs. Similarly, spectral Turán-type extremal problem asks to maximize spectral radius or signless Laplacian spectral radius over all graphs which do not contain fixed forbidden subgraphs. Linear forests are graphs consisting of vertex disjoint paths. In this talk, we introduce all graphs of sufficiently large order n which do not contain linear forests with at most two components of odd order and determine the unique graphs maximizing the signless Laplacian spectral radius.