Sharp Bounds for Neighborhood degree based indices of Graphs
Sanju Vaidya, Jeff Chang
TL;DR
This paper develops formulas and bounds for neighborhood degree-based indices in graphs, identifies graphs that reach these bounds, and establishes a lower bound for the spectral radius of any graph.
Contribution
It introduces new bounds for neighborhood degree indices and spectral radius, and characterizes graphs that attain these bounds.
Findings
Formulas and bounds for neighborhood degree-based indices.
Graphs that attain the bounds are characterized.
A lower bound for the spectral radius of graphs is established.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph theory and applications · Graph Labeling and Dimension Problems