Minimizing the spectral radius of unicyclic graphs with fixed order and dissociation number
math.CO
Submitted: 2026-10-28
Updated: 2026-10-28
Comments: 21 pages, 17 figures
License: http://creativecommons.org/licenses/by/4.0/
The gist: A dissociation set of a graph G is a vertex subset S contained in V(G) such that the induced subgraph G[S] has maximum degree at most 1…
Abstract
A dissociation set of a graph G is a vertex subset S contained in V(G) such that the induced subgraph G[S] has maximum degree at most 1, and the dissociation number of G is the cardinality of a maximum dissociation set denoted by Φ(G). In this paper, we first derive a sharp lower bound on the dissociation number for all unicyclic graphs. Furthermore, we also study the graphs with minimum spectral radius among all unicyclic graphs with given order and dissociation number and explicitly identify all extremal graphs for n-4 at most Φ(G) at most n-1.
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality