Essential connectivity and spectral radius of graphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909231087616000 |
|---|---|
| author | Ding, Wenxiu Li, Dan Wang, Yu Meng, Jixiang |
| author_facet | Ding, Wenxiu Li, Dan Wang, Yu Meng, Jixiang |
| contents | A graph is trivial if it contains one vertex and no edges. The essential connectivity $κ^{\prime}$ of $G$ is defined to be the minimum number of vertices of $G$ whose removal produces a disconnected graph with at least two non-trivial components. Let $\mathcal{A}_n^{κ',δ}$ be the set of graphs of order $n$ with minimum degree $δ$ and essential connectivity $κ'$. In this paper, we determine the graphs attaining the maximum spectral radii among all graphs in $\mathcal{A}_n^{κ',δ}$ and characterize the corresponding extremal graphs. In addition, we also determine the digraphs which achieve the maximum spectral radii among all strongly connected digraphs with given essential connectivity and give the exact values of the spectral radii of these digraphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_17330 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Essential connectivity and spectral radius of graphs Ding, Wenxiu Li, Dan Wang, Yu Meng, Jixiang Combinatorics A graph is trivial if it contains one vertex and no edges. The essential connectivity $κ^{\prime}$ of $G$ is defined to be the minimum number of vertices of $G$ whose removal produces a disconnected graph with at least two non-trivial components. Let $\mathcal{A}_n^{κ',δ}$ be the set of graphs of order $n$ with minimum degree $δ$ and essential connectivity $κ'$. In this paper, we determine the graphs attaining the maximum spectral radii among all graphs in $\mathcal{A}_n^{κ',δ}$ and characterize the corresponding extremal graphs. In addition, we also determine the digraphs which achieve the maximum spectral radii among all strongly connected digraphs with given essential connectivity and give the exact values of the spectral radii of these digraphs. |
| title | Essential connectivity and spectral radius of graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2406.17330 |