Cioabă–Gregory's maximum principal ratio conjecture for connected graphs
Statement
Let be a simple, undirected connected graph on vertices. Let be the positive unit eigenvector of its adjacency matrix corresponding to the largest eigenvalue, and define the principal ratio by
where and are the smallest and largest entries of . For integers , let be the graph of order obtained by identifying an end vertex of the path with a vertex of the complete graph ; this is called a kite graph. Cioabă–Gregory's conjecture. Among all connected graphs on vertices, the kite graph attains the maximum principal ratio.
The conjecture identifies the extremal graph for the irregularity measure given by the principal ratio, extending the study of eigenvector bounds for connected graphs. The supplied text does not state whether the conjecture has been resolved.
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.