ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a simple, undirected connected graph on nn vertices. Let x{\bf x} be the positive unit eigenvector of its adjacency matrix corresponding to the largest eigenvalue, and define the principal ratio by

γ(G):=xmax⁡xmin⁡,\gamma(G):=\frac{x_{\max}}{x_{\min}},

where xmin⁡x_{\min} and xmax⁡x_{\max} are the smallest and largest entries of x{\bf x}. For integers r,s≥1r,s\geq 1, let Pr⋅KsP_r\cdot K_s be the graph of order r+s−1r+s-1 obtained by identifying an end vertex of the path PrP_r with a vertex of the complete graph KsK_s; this is called a kite graph. Cioabă–Gregory's conjecture. Among all connected graphs on nn 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.