Bound for the energy of graphs in terms of degrees and leaves
Octavio Arizmendi, Samuel Gurrola-Viramontes
TL;DR
This paper introduces a new upper bound for the energy of graphs based on degrees and leaves, and applies it to analyze Erdős-Rényi graphs and Barabási-Albert trees.
Contribution
It presents a novel upper bound for graph energy that incorporates degree and leaf information, advancing spectral graph theory.
Findings
New upper bound for graph energy in terms of degrees and leaves
Application of the bound to Erdős-Rényi graphs
Application of the bound to Barabási-Albert trees
Abstract
We provide a new upper bound for the energy of graphs in terms of degrees and number of leaves. We apply this formula to study the energy of Erd\"os-R\'enyi graphs and Barabasi-Albert trees.
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
TopicsGraph theory and applications · Graph Theory and Algorithms · Advanced Graph Theory Research