paper

Signless Laplacian spectral radius of graphs without short cycles or long cycles

arXiv:2305.03280 · doi:10.1016/j.laa.2022.03.011

Abstract

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.

13 pages, one figure