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

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

An upper bound on the maximal entry in the principal eigenvector of a symmetric nonnegative matrix with zero diagonal entries is investigated in [S. Zhao, Y. Hong, On the bounds of maximal entries in the principal eigenvector of symmetric nonnegative matrix, Linear Algebra Appl. 340 (2002) 245-252]. We obtain a sharp upper bound on the maximal entry ymaxp in the principal eigenvector of symmetric nonnegative matrix in terms of order, the spectral radius, the largest and the smallest diagonal entries of that matrix. Our bound is applicable for any symmetric nonnegative matrix and the upper bound of Zhao and Hong (2002) for the maximal entry ymaxp follows as a special case. Moreover, we find an upper bound on maximal entry in the principal eigenvector for the signless Laplacian matrix of a graph.

Original languageEnglish
Pages (from-to)1340-1350
Number of pages11
JournalLinear Algebra and Its Applications
Volume431
Issue number8
DOIs
StatePublished - 1 Sep 2009

Keywords

  • Graph theory
  • Principal eigenvector
  • Signless Laplacian matrix
  • Spectral radius
  • Symmetric nonnegative matrix

Fingerprint

Dive into the research topics of 'A sharp upper bound on the maximal entry in the principal eigenvector of symmetric nonnegative matrix'. Together they form a unique fingerprint.

Cite this