Sharp Bounds for Neighborhood degree based indices of Graphs
Combinatorics
2024-11-21 v1
Abstract
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.
Cite
@article{arxiv.2411.12984,
title = {Sharp Bounds for Neighborhood degree based indices of Graphs},
author = {Sanju Vaidya and Jeff Chang},
journal= {arXiv preprint arXiv:2411.12984},
year = {2024}
}
Comments
arXiv admin note: substantial text overlap with arXiv:2409.06081