Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph

DOI10.1016/J.DISC.2011.07.034zbMATH Open1238.05159OpenAlexW2017973357MaRDI QIDQ409384FDOQ409384

Kinkar Ch. Das

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

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
• On the largest eigenvalue of the distance matrix of a bipartite graph
• Eigenvectors of Distance-Regular Graphs
• On the distance and distance Laplacian eigenvalues of graphs
• scientific article; zbMATH DE number 6310836
• 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

zbMATH Keywords

spectral radiusdistance matrixprincipal eigenvectordiameter of a graph

Mathematics Subject Classification ID

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?)
• The distance spectrum of the pathP_nand The First Distance Eigenvector of Connected Graphs
• Title not available (Why is that?)
• Sharp bounds on the distance spectral radius and the distance energy of graphs
• On the distance spectra of some 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
• On the largest eigenvalue of the distance matrix of a tree
• On the largest eigenvalue of the distance matrix of a bipartite graph

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

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)