Characterizing graphs of maximum principal ratio

MaRDI QIDQ4568074zbMATH OpenFDO

Authors Michael Tait, Josh Tobin

Publication date 15 June 2018

Full work available at URL https://arxiv.org/abs/1511.06378

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

eigenvectorsspectral radiusirregular graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Abstract: The principal ratio of a connected graph, denoted $gamma(G)$, is the ratio of the maximum and minimum entries of its first eigenvector. Cioabu{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.

Recommendations

• The maximum principal ratio of graphs
• Maximum principal ratio of the signless Laplacian of graphs
• Principal eigenvectors of irregular graphs
• ON SOME SPECTRAL PROPERTIES OF GRAPHS IN TERMS OF THEIR MAXIMUM MATCHINGS AND MINIMUM VERTEX COVERS
• On maximal entries in the principal eigenvector of graphs

Cites work

• scientific article; zbMATH DE number 1409213 (Why is no real title available?)
• A Remark on Minc’s Maximal Eigenvector Bound for Positive Matrices
• A note on the irregularity of graphs
• Eigenvalues and degree deviation in graphs
• Eigenvectors and eigenvalues of non-regular graphs
• Maximum hitting time for random walks on graphs
• On maximal entries in the principal eigenvector of graphs
• On the Maximal Eigenvector of a Positive Matrix
• Principal eigenvectors of irregular graphs
• Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
• Variable neighborhood search for extremal graphs. IX: Bounding the irregularity of a graph

Cited in

(11)

• Principal eigenvector of the signless Laplacian matrix
• On the stability of the principal ratio
• The kite graph is determined by its adjacency spectrum
• The maximum principal ratio of graphs
• Three conjectures in extremal spectral graph theory
• A unified framework for the expander mixing lemma for irregular graphs and its applications
• A complete solution to the Cvetković–Rowlinson conjecture
• Comparing eigenvector and degree dispersion with the principal ratio of a graph
• Maximum principal ratio of the signless Laplacian of graphs
• Spectral geometry and Riemannian manifold mesh approximations: some autocorrelation lessons from spatial statistics
• Principal eigenvectors of irregular graphs

This page was built for publication: Characterizing graphs of maximum principal ratio

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568074)