Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 5 May 2023 in math.CO | (2305.03280v1)

Abstract: The signless Laplacian spectral radius of a graph $G$, denoted by $q(G)$, 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 $\mathcal{G}(m,g)$ be the family of graphs on $m$ edges with girth $g$ and $\mathcal{H}(m,c)$ be the family of graphs on $m$ edges with circumference $c$. More precisely, we obtain the unique extremal graph with maximal $q(G)$ in $\mathcal{G}(m,g)$ and $\mathcal{H}(m,c)$, respectively.

Authors (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.