摘要
There have been many attempts of understanding graph structures by investigating graph entropies. In this article we investigate approximations for von Neumann and Renyi-alpha entropies of paths and rings, using the Euler-Maclaurin summation formula. For alpha an integer, the approximations become exact, and, in general, the obtained estimates have a remarkable degree of accuracy.
- 出版日期2018
- 单位华东师范大学