Abstract
The principal ratio of a connected graph, denoted γ(G), is the ratio of the maximum and minimum entries of its Perron eigenvector. Cioabă and Gregory (2007) conjectured that the graph on n vertices maximizing γ(G) is a kite graph, that is, a complete graph with a pendant path. In this paper, their conjecture is proved.
Author supplied keywords
Cite
CITATION STYLE
APA
Tait, M., & Tobin, J. (2018). Characterizing graphs of maximum principal ratio. Electronic Journal of Linear Algebra, 34(1), 61–70. https://doi.org/10.13001/1081-3810.3200
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free