Recognition: unknown
Characterizing graphs of maximum principal ratio
classification
🧮 math.CO
keywords
graphratiogammamaximumprincipalcharacterizingcioabcomplete
read the original 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\u{a} 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.