Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph
From MaRDI portal
Publication:409384
DOI10.1016/j.disc.2011.07.034zbMath1238.05159OpenAlexW2017973357MaRDI QIDQ409384
Publication date: 13 April 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.07.034
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12)
Related Items (9)
On the principal eigenvectors of uniform hypergraphs ⋮ The first eigenvector of a distance matrix is nearly constant ⋮ The generalized distance matrix ⋮ Bounds on the entries of the principal eigenvector of the distance signless Laplacian matrix ⋮ Principal eigenvector of the signless Laplacian matrix ⋮ Distance spectra of graphs: a survey ⋮ Bounds on maximal and minimal entries of the \(p\)-normalized principal eigenvector of the distance and distance signless Laplacian matrices of graphs ⋮ On distance Laplacian and distance signless Laplacian eigenvalues of graphs ⋮ Bounds for Generalized Distance Spectral Radius and the Entries of the Principal Eigenvector
Cites Work
- A sharp upper bound on the maximal entry in the principal eigenvector of symmetric nonnegative matrix
- Sharp bounds on the distance spectral radius and the distance energy of graphs
- On maximal entries in the principal eigenvector of graphs
- The distance spectrum of the pathPnand The First Distance Eigenvector of Connected Graphs
- On the bounds of maximal entries in the principal eigenvector of symmetric nonnegative matrix
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph
