On maximal entries in the principal eigenvector of graphs

DOI10.1016/S0024-3795(00)00063-XzbMath0966.05047OpenAlexW2050784462WikidataQ126459134 ScholiaQ126459134MaRDI QIDQ1978123

Peter Recht, Britta Papendieck

Publication date: 25 May 2000

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

Full work available at URL: https://doi.org/10.1016/s0024-3795(00)00063-x

zbMATH Keywords

eigenvectorprincipal eigenvalue

Mathematics Subject Classification ID

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

Related Items

Maximizing the sum of the squares of the degrees of a graph, A sharp upper bound on the maximal entry in the principal eigenvector of symmetric nonnegative matrix, ON SOME SPECTRAL PROPERTIES OF GRAPHS IN TERMS OF THEIR MAXIMUM MATCHINGS AND MINIMUM VERTEX COVERS, Principal eigenvectors and spectral radii of uniform hypergraphs, On the largest eigenvalue of non-regular graphs, On the principal eigenvectors of uniform hypergraphs, Some New Results on the Eigenvector Centrality, Eigenvalues of the resistance-distance matrix of complete multipartite graphs, Extensions on spectral extrema of \(C_5/C_6\)-free graphs with given size, Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph, On least eigenvalues and least eigenvectors of real symmetric matrices and graphs, The eigenvectors to the \(p\)-spectral radius of general hypergraphs, The first eigenvector of a distance matrix is nearly constant, The efficiency and stability of R\&D networks, The principal eigenvector to \(\alpha\)-spectral radius of hypergraphs, Bounds on the spectral radius of uniform hypergraphs, Bounds on the entries of the principal eigenvector of the distance signless Laplacian matrix, Principal eigenvector of the signless Laplacian matrix, Analytic methods for uniform hypergraphs, Bounds on maximal and minimal entries of the \(p\)-normalized principal eigenvector of the distance and distance signless Laplacian matrices of graphs, Characterizing graphs of maximum principal ratio, On the bounds of maximal entries in the principal eigenvector of symmetric nonnegative matrix, Betweenness Centrality: Extremal Values and Structural Properties, On Laplacian energy, Laplacian-energy-like invariant and Kirchhoff index of graphs, Degree-based energies of graphs, Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs, Extreme values of the stationary distribution of random walks on directed graphs, The maximum spectral radius of \(C_4\)-free graphs of given order and size, Finding the resistance distance and eigenvector centrality from the network's eigenvalues, Some new bounds on the spectral radius of graphs, Eigenvectors and eigenvalues of non-regular graphs, Bounds for Generalized Distance Spectral Radius and the Entries of the Principal Eigenvector

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds of eigenvalues of graphs
• Assessing quantification for the EMS algorithm
• Rigorous perturbation bounds for eigenvalues and eigenvectors of a matrix
• Computation of Bounds for the Positive Eigenvector of a Nonnegative Irreducible Matrix by Monotone Iteration
• A Remark on Minc’s Maximal Eigenvector Bound for Positive Matrices