Characterizing graphs of maximum principal ratio

Abstract

The principal ratio of a connected graph, denoted $\gamma (G)$, is the ratio of the maximum and minimum entries of its first eigenvector. Cioabă and Gregory conjectured that the graph on $n$ vertices maximizing $\gamma (G)$ is a kite graph: a complete graph with a pendant path. In this paper we prove their conjecture.