The Brualdi-Solheid-Turán type problem has attracted wide attention recently. Let F be a set of graphs. A graph G is F-free if it does not contain any element of F as a subgraph. In this paper, when F 1 = {W 5 , C 6 } and F 2 = {F 5 }, we determine the maximum signless Laplacian spectral radius of F i-free graph with n vertices, respectively and depict the corresponding extremal graph for i = 1, 2.