Abstract
We use Hadamard's determinantal inequality and its generalization to prove some upper bounds on the energy of a graph in terms of degrees, average 2-degrees and number of common neighbors of its vertices. Also, we prove an inequality relating the energy of a graph and one arbitrary subgraph of it.
Publisher
University Library in Kragujevac
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Science Applications,General Chemistry
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Improved lower bound on the energy of line graphs;Linear Algebra and its Applications;2023-10
2. Some Results on Spectrum and Energy of Graphs with Loops;Bulletin of the Malaysian Mathematical Sciences Society;2023-03-27