The star conjecture for minimum von Neumann entropy of connected graphs
Statement
Let be a connected graph on vertices. Its scaled Laplacian is , where , with the diagonal degree matrix and the adjacency matrix. The von Neumann entropy of is the Shannon entropy of the eigenvalues of , namely
Here . The star conjecture. For all connected graphs on vertices, the minimum von Neumann entropy is attained by the star .
This was posed because the minimum over connected graphs was open, although the extrema over all graphs were known. It was confirmed computationally through vertices, and for trees through vertices; the paper proves it for almost all graphs as , while the general connected-graph case remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.