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.034zbMATH Open1238.05159OpenAlexW2017973357MaRDI QIDQ409384FDOQ409384
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) Eigenvalues, singular values, and eigenvectors (15A18) Inequalities involving eigenvalues and eigenvectors (15A42) Distance in graphs (05C12)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The distance spectrum of the pathPnand The First Distance Eigenvector of Connected Graphs
- Sharp bounds on the distance spectral radius and the distance energy of graphs
- On maximal entries in the principal eigenvector of 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
- Graph-theoretical matrices in chemistry
Cited In (11)
- Principal eigenvector of the signless Laplacian matrix
- Bounds for Generalized Distance Spectral Radius and the Entries of the Principal Eigenvector
- Bounds on maximal and minimal entries of the \(p\)-normalized principal eigenvector of the distance and distance signless Laplacian matrices of graphs
- Distance spectra of graphs: a survey
- On distance Laplacian and distance signless Laplacian eigenvalues of graphs
- On the principal eigenvectors of uniform hypergraphs
- Bounds on the entries of the principal eigenvector of the distance signless Laplacian matrix
- On the bounds of maximal entries in the principal eigenvector of symmetric nonnegative matrix
- The first eigenvector of a distance matrix is nearly constant
- The generalized distance matrix
- On maximal entries in the principal eigenvector of graphs
Recommendations
- On maximal entries in the principal eigenvector of graphs π π
- Bounds on maximal and minimal entries of the \(p\)-normalized principal eigenvector of the distance and distance signless Laplacian matrices of graphs π π
- On the least distance eigenvalue of a graph π π
- Title not available (Why is that?) π π
- Eigenvectors of Distance-Regular Graphs π π
- On the distance and distance Laplacian eigenvalues of graphs π π
- Title not available (Why is that?) π π
- Eigenvalues, diameter, and mean distance in graphs π π
- Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian π π
- On the adjacency matrix of graphs: principal eigenvector versus degree vector π π
This page was built for publication: Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409384)