Upper bounds on the Q-spectral radius of book-free and/or $K_{s,t}$-free graphs
Qi Kong, Ligong Wang

TL;DR
This paper establishes upper bounds on the signless Laplacian spectral radius for certain classes of graphs that are free of specific subgraphs, such as books and complete bipartite graphs, with conditions for equality.
Contribution
It provides new upper bounds on the signless Laplacian spectral radius for book-free and $K_{s,t}$-free graphs, extending spectral graph theory results.
Findings
Derived bounds depend on maximum degree and graph order.
Equality cases characterized by strongly regular graphs.
Bounds improve understanding of spectral properties in forbidden subgraph classes.
Abstract
In this paper, we prove two results about the signless Laplacian spectral radius of a graph of order with maximum degree . Let denote a book, i.e., the graph consists of triangles sharing an edge. (1) Let and be a connected \{\}-free graph of order with maximum degree . Then with equality holds if and only if is a strongly regular graph with parameters (, , ). (2) Let , and let be a connected -free graph of order . Then
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
