Minimum spectral radius of graphs of fixed order and dissociation number and its connection to Tur\'an problems

TL;DR

This paper investigates the minimum spectral radius and size of graphs with fixed order and dissociation number, connecting these properties to Turán problems and characterizing extremal graphs.

Contribution

It extends Turán-type results to graphs with fixed dissociation number and minimum spectral radius, providing structural characterizations and stability results.

Findings

Characterized Turán graphs for certain multipartite graphs.

Proved that minimum spectral radius graphs are also minimum size graphs for large n.

Derived bounds on dissociation number for given graphs.

Abstract

Let $\mathcal{D}_{n,\tau}$ be the set of all simple connected graphs of order $n$ and dissociation number $\tau.$ In this paper, we study the minimum size and the minimum spectral radius of graphs in $\mathcal{D}_{n,\tau}$ in connection with Tur\'an-type problems for complete multipartite graphs. We characterize the Tur\' an graphs for several complete multipartite graphs where the size of one of the partite sets is much smaller than the size of the remaining partites. This extends a result of Erd\H{o}s and Simonovits [16]. Additionally, we prove some stability results to get the structure of graphs without such a forbidden complete multipartite subgraph, and close to Tur\'an number of edges. As an application, we show that a graph with the minimum spectral radius in $\mathcal{D}_{n,\tau}$ must be a graph with the minimum size in $\mathcal{D}_{n, \tau}$ when $n$ is sufficiently large and satisfies some parity conditions. We then describe a few structural properties of graphs with the minimum spectral radius in $\mathcal{D}_{n,\tau}$. For even dissociation numbers and any order $n$, we compute the minimum size of a graph in $\mathcal{D}_{n,\tau}$ and use it to characterize the graphs in $\mathcal{D}_{n, 4}$ that attain the minimum size and the minimum spectral radius. We also apply the stability results to upper bound the minimum number of edges and spectral radius for connected graphs with a given $d$-independence number when the order of the graph is sufficiently large. Finally, we derive two new bounds on the value of $\tau(G)$ for a given graph $G$.