Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6871800 | Discrete Applied Mathematics | 2017 | 6 Pages |
Abstract
Let G be a graph with n vertices and L(G) its Laplacian matrix. Define ÏG=1dGL(G) to be the density matrix of G, where dG denotes the sum of degrees of all vertices of G. Let λ1,λ2,â¦,λn be the eigenvalues of ÏG. The von Neumann entropy of G is defined as S(G)=ââi=1nλilog2λi. In this paper, we establish a lower bound and an upper bound to the von Neumann entropy for random multipartite graphs.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Dan Hu, Xueliang Li, Xiaogang Liu, Shenggui Zhang,