Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5773096 | Linear Algebra and its Applications | 2017 | 13 Pages |
Abstract
We conjecture that all connected graphs of order n have von Neumann entropy at least as great as the star K1,nâ1 and prove this for almost all graphs of order n. We show that connected graphs of order n have Rényi 2-entropy at least as great as K1,nâ1 and for α>1, Kn maximizes Rényi α-entropy over graphs of order n. We show that adding an edge to a graph can lower its von Neumann entropy.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Michael Dairyko, Leslie Hogben, Jephian C.-H. Lin, Joshua Lockhart, David Roberson, Simone Severini, Michael Young,