arXiv Analytics

Sign in

arXiv:0909.4923 [math.CO]AbstractReferencesReviewsResources

The energy of random graphs

Wenxue Du, Xueliang Li, Yiyang Li

Published 2009-09-27Version 1

In 1970s, Gutman introduced the concept of the energy $\En(G)$ for a simple graph $G$, which is defined as the sum of the absolute values of the eigenvalues of $G$. This graph invariant has attracted much attention, and many lower and upper bounds have been established for some classes of graphs among which bipartite graphs are of particular interest. But there are only a few graphs attaining the equalities of those bounds. We however obtain an exact estimate of the energy for almost all graphs by Wigner's semi-circle law, which generalizes a result of Nikiforov. We further investigate the energy of random multipartite graphs by considering a generalization of Wigner matrix, and obtain some estimates of the energy for random multipartite graphs.

Related articles: Most relevant | Search more
arXiv:0906.4636 [math.CO] (Published 2009-06-25, updated 2009-10-10)
The Laplacian energy of random graphs
arXiv:1302.3657 [math.CO] (Published 2013-02-15, updated 2013-03-08)
Some Remarks on Graphical Sequences for Graphs and Bipartite Graphs
arXiv:1902.01322 [math.CO] (Published 2019-02-04)
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs