Affiliation:
1. Karnatak University, India
Abstract
The energy of a graph G is defined as the sum of the absolute values of the eigenvalues of its adjacency matrix. The graph energy has close correlation with the total pi-electron energy of molecules calculated with Huckel molecular orbital method in chemistry. A graph whose energy is greater than the energy of complete graph of same order is called hyperenergetic graph. A non-complete graph having energy equal to the energy of complete graph is called borderenergetic graph. Two non-cospectral graphs are said to be equienergetic graphs if they have same energy. In this chapter, the results on graph energy are reported. Various bounds for graph energy and its characterization are summarized. Construction of hyperenergetic, borderenergetic, and equienergetic graphs are reported.
Reference53 articles.
1. Acharya, Rao, & Walika. (2003). Energy of signed digraphs. Lecture Notes, Group Discussion on Energy of a Graph. Karnatak University.
2. On spectra of variants of the corona of two graphs and some new equienergetic graphs
3. The energy of a graph
4. Equienergetic chemical trees
5. Iterated line graphs;F.Buckley;Congr. Numer.,1981
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献