Comparing eigenvector and degree dispersion with the principal ratio of a graph

DOI10.1080/03081087.2022.2158171arXiv2202.00325OpenAlexW4313455902MaRDI QIDQ6198665

Gregory J. Clark

Publication date: 23 February 2024

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

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

zbMATH Keywords

eigenvectorgolden ratiocoefficient of variationprincipal ratiolocal clustering coefficient

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The splittance of a graph
• A note on the irregularity of graphs
• Eigenvalues of random power law graphs
• Eigenvectors and eigenvalues of non-regular graphs
• Emergence of Scaling in Random Networks
• Maximum hitting time for random walks on graphs
• Split Graphs Having Dilworth Number Two
• Characterizing graphs of maximum principal ratio
• Robustness and Vulnerability of Scale-Free Random Graphs

This page was built for publication: Comparing eigenvector and degree dispersion with the principal ratio of a graph