On maximal entries in the principal eigenvector of graphs

DOI10.1016/S0024-3795(00)00063-XzbMATH Open0966.05047OpenAlexW2050784462WikidataQ126459134 ScholiaQ126459134MaRDI QIDQ1978123FDOQ1978123

Authors: Britta Papendieck, Peter Recht 

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

Recommendations

• Principal eigenvectors of irregular graphs
• scientific article; zbMATH DE number 7365978
• ON SOME SPECTRAL PROPERTIES OF GRAPHS IN TERMS OF THEIR MAXIMUM MATCHINGS AND MINIMUM VERTEX COVERS
• Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph
• On the adjacency matrix of graphs: principal eigenvector versus degree vector

zbMATH Keywords

eigenvectorprincipal eigenvalue

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Eigenspaces of graphs
• Rigorous perturbation bounds for eigenvalues and eigenvectors of a matrix
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounds of eigenvalues of graphs
• A Remark on Minc’s Maximal Eigenvector Bound for Positive Matrices
• Computation of Bounds for the Positive Eigenvector of a Nonnegative Irreducible Matrix by Monotone Iteration
• Assessing quantification for the EMS algorithm

Cited In (38)

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

This page was built for publication: On maximal entries in the principal eigenvector of graphs

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