Characterizing graphs of maximum principal ratio

zbMath1390.05138arXiv1511.06378MaRDI QIDQ4568074

Michael Tait, Josh Tobin

Publication date: 15 June 2018

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

zbMATH Keywords

spectral radiuseigenvectorsirregular graph

Mathematics Subject Classification ID

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

Related Items (8)

Three conjectures in extremal spectral graph theory ⋮ Maximum principal ratio of the signless Laplacian of graphs ⋮ A complete solution to the Cvetković–Rowlinson conjecture ⋮ The maximum principal ratio of graphs ⋮ On the stability of the principal ratio ⋮ Comparing eigenvector and degree dispersion with the principal ratio of a graph ⋮ Principal eigenvector of the signless Laplacian matrix ⋮ The kite graph is determined by its adjacency spectrum

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eigenvalues and degree deviation in graphs
• Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
• A note on the irregularity of graphs
• On maximal entries in the principal eigenvector of graphs
• Eigenvectors and eigenvalues of non-regular graphs
• Maximum hitting time for random walks on graphs
• A Remark on Minc’s Maximal Eigenvector Bound for Positive Matrices
• On the Maximal Eigenvector of a Positive Matrix

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