On the signless Laplacian spectral radius of $C_{4}$-free $k$-cyclic graphs
Qi Kong, Ligong Wang

TL;DR
This paper investigates the maximum signless Laplacian spectral radius in $C_{4}$-free $k$-cyclic graphs, identifying extremal structures and extending results to Laplacian spectra.
Contribution
It determines the extremal graphs with maximal signless Laplacian spectral radius among $C_{4}$-free $k$-cyclic graphs and specific unicyclic and bicyclic cases.
Findings
Identified extremal graphs with maximum spectral radius.
Extended results to Laplacian spectral radius.
Provided explicit structures for maximal spectral cases.
Abstract
A -cyclic graph is a connected graph of order and size . In this paper, we determine the maximal signless Laplacian spectral radius and the corresponding extremal graph among all -free -cyclic graphs of order . Furthermore, we determine the first three unicyclic, and bicyclic, -free graphs whose spectral radius of the signless Laplacian is maximal. Similar results are obtained for the (combinatorial) Laplacian.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Finite Group Theory Research · Limits and Structures in Graph Theory
