Sharp Bounds for Neighborhood degree based indices 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_ | 1866910705643421696 |
|---|---|
| author | Vaidya, Sanju Chang, Jeff |
| author_facet | Vaidya, Sanju Chang, Jeff |
| contents | In this paper, we will construct formulas and bounds for Neighborhood Degree-based indices of graphs and describe graphs that attain the bounds. Furthermore, we will establish a lower bound for the spectral radius of any graph. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_12984 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Sharp Bounds for Neighborhood degree based indices of Graphs Vaidya, Sanju Chang, Jeff Combinatorics In this paper, we will construct formulas and bounds for Neighborhood Degree-based indices of graphs and describe graphs that attain the bounds. Furthermore, we will establish a lower bound for the spectral radius of any graph. |
| title | Sharp Bounds for Neighborhood degree based indices of Graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2411.12984 |