加载中…
The signless Laplacian spectral radius of a graph , denoted by , is the largest eigenvalue of its signless Laplacian matrix. In this paper, we investigate extremal signless Laplacian spectral radius for graphs without short cycles or long cycles. Let be the family of graphs on edges with girth and be the family of graphs on edges with circumference . More precisely, we obtain the unique extremal graph with maximal in and , respectively.

生成讲解博客的中文版本

生成AI智能校验的中文版本