Year: 2026
Type: preprint
Abstract: An independent set of a graph G is a subset of VG, no two of which are adjacent. The cardinality of a maximum independent set in a graph G is called the independence number of G, denoted by alpha(G). The essential connectivity kappa'(G) of a graph G is denoted as the minimum number of vertices of G whose removal produces a disconnected graph with at least two non-trivial components. In this paper, we determine the n-vertex connected graphs with given independence number and essential connectivity that attain the minimum distance spectral radius, and fully characterize the corresponding extremal graphs.
Source: arXiv (Cornell University)
Authors: Ding, Shuang, Li, Dan, Chen, Yuanyuan
Institution: Xinjiang University
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Award: G6294865353
OpenAlex ID: W7214906100