M. Basunia

Characterization of graphs attaining the maximum signless Laplacian spectral radius under forbidden cycles and theta graphs

Spectral Tur\'an-type problems ask how the absence of prescribed subgraphs constrains the spectral radius of a matrix associated with a graph. Given a family of graphs $\mathcal{F}$, a graph is called $\mathcal{F}$-free if it contains no member of $\mathcal{F}$ as a subgraph. The theta graph $\theta(l_1,\ldots,l_k)$ co...