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

DOI10.1016/J.LAA.2009.05.005MaRDI QIDQ837012zbMATH OpenOpenAlexFDO

Authors Kinkar Ch. 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

graph theoryspectral radiussignless Laplacian matrixPerron-Frobenius theoryprincipal eigenvectorsymmetric nonnegative 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)

Recommendations

• On the bounds of maximal entries in the principal eigenvector of symmetric nonnegative matrix
• Bounds on the entries of the principal eigenvector of the distance 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
• An upper bound for the largest eigenvalue of a nonnegative symmetric matrix with zero diagonal
• Upper bounds for the second largest eigenvalue of symmetric nonnegative matrices

Cites work

• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 1168330 (Why is no real title available?)
• Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
• On maximal entries in the principal eigenvector of graphs
• On the bounds of maximal entries in the principal eigenvector of symmetric nonnegative matrix
• Signless Laplacians of finite graphs
• The Laplacian spectrum of a graph

Cited in

(11)

• Principal eigenvector of the signless Laplacian matrix
• An upper bound for the largest eigenvalue of a nonnegative symmetric matrix with zero diagonal
• 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
• 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 bounds of extremal eigenvalues of irreducible and \(m\)-reducible matrices
• 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
• The first eigenvector of a distance matrix is nearly constant

This page was built for publication: A sharp upper bound on the maximal entry in the principal eigenvector of symmetric nonnegative matrix

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