Four's a Crowd conjecture for eigenvector dispersion
Statement
Let be a connected graph on vertices. Write for the kite graph consisting of a path attached to a complete graph , and let denote the eigenvector dispersion of . Four's a Crowd conjecture. The connected graph which achieves the maximum of on vertices is . This conjecture specifies the proposed extremal kite graph for eigenvector dispersion; the surrounding discussion notes that related extremal graph problems have different optimal head sizes, but gives no resolution of this claim.
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.