The signless Laplacian spectral radius of a graph G, denoted by q(G), is the largest eigenvalue its matrix. In this paper, we investigate extremal for graphs without short cycles or long cycles. Let G(m,g) be family on m edges with girth g and H(m,c) circumference c. More precisely, obtain unique maximal q(G) in H(m,c), respectively.