Irregular graph, eigenvector, principal ratio


The principal ratio of a connected graph, denoted γ(G), is the ratio of the maximum and minimum entries of its Perron eigenvector. Cioaba 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

abs_vol34_pp61-70.pdf (98 kB)
PDF of abstract



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.