A sharp upper bound on the maximal entry in the principal eigenvector of symmetric nonnegative matrix

DOI10.1016/j.laa.2009.05.005zbMath1202.15023OpenAlexW1965186614MaRDI QIDQ837012

Kinkar Chandra Das

Publication date: 10 September 2009

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

Full work available at URL: https://doi.org/10.1016/j.laa.2009.05.005

zbMATH Keywords

spectral radiusgraph theoryPerron-Frobenius theoryprincipal eigenvectorsymmetric nonnegative matrixsignless Laplacian matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items

On the principal eigenvectors of uniform hypergraphs ⋮ 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 first eigenvector of a distance matrix is nearly constant ⋮ Bounds on the entries of the principal eigenvector of the distance signless Laplacian matrix ⋮ Principal eigenvector of the signless Laplacian matrix ⋮ Bounds on maximal and minimal entries of the \(p\)-normalized principal eigenvector of the distance and distance signless Laplacian matrices of graphs ⋮ Bounds for Generalized Distance Spectral Radius and the Entries of the Principal Eigenvector

Cites Work

• Unnamed Item
• Unnamed Item
• Signless Laplacians of finite graphs
• The Laplacian spectrum of a graph
• On maximal entries in the principal eigenvector of graphs
• Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
• On the bounds of maximal entries in the principal eigenvector of symmetric nonnegative matrix