The distance spectral radius of $k$-uniform hypertrees with given number of vertices of maximum degree
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909136884596736 |
|---|---|
| author | Liu, Xiaoqi Shan, Haiying |
| author_facet | Liu, Xiaoqi Shan, Haiying |
| contents | This paper investigates the influence of two graft transformations on the distance spectral radius of connected uniform hypergraphs. Specifically, we study $k$-uniform hypertrees with given size, maximum degree and number of vertices of maximum degree, and give the structure of such hypergraph with maximum distance spectral radius. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_09376 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The distance spectral radius of $k$-uniform hypertrees with given number of vertices of maximum degree Liu, Xiaoqi Shan, Haiying Combinatorics This paper investigates the influence of two graft transformations on the distance spectral radius of connected uniform hypergraphs. Specifically, we study $k$-uniform hypertrees with given size, maximum degree and number of vertices of maximum degree, and give the structure of such hypergraph with maximum distance spectral radius. |
| title | The distance spectral radius of $k$-uniform hypertrees with given number of vertices of maximum degree |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2403.09376 |