The star conjecture for minimum Rényi entropy of connected graphs
Statement
Let be a graph with at least one edge, let be its combinatorial Laplacian, and define the scaled Laplacian by . For , the Rényi -entropy of is
where the are the eigenvalues of . The star conjecture. For and any connected graph on vertices,
This is the Rényi-entropy analogue of the conjecture that the star minimizes von Neumann entropy among connected graphs. The paper establishes the corresponding unrestricted extremal bounds but leaves the connected-graph minimum as a conjecture.
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.