Abstract
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 F1 = {W5,C6} and F2 = {F5}, we determine the maximum signless Laplacian spectral radius of Fi-free graph with n vertices, respectively and depict the corresponding extremal graph for i = 1,2.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
