The principal ratio of a connected graph, denoted $γ(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 $γ(G)$ is a kite graph: a complete graph with a pendant path. In this paper we prove their conjecture.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。