Bounds for Generalized Distance Spectral Radius and the Entries of the Principal Eigenvector

DOI10.5556/j.tkjm.52.2021.3280zbMath1476.05105OpenAlexW3128067548MaRDI QIDQ5016456

Gui-Xian Tian, Abdollah Alhevaz, Maryam Baghipur, Hilal A. Ganie

Publication date: 13 December 2021

Published in: Tamkang Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5556/j.tkjm.52.2021.3280

zbMATH Keywords

spectral radiusPerron vectorgeneralized distance matrixtransmission regular graphdistance matrix (spectrum)distance signlees Laplacian matrix (spectrum)

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12)

Related Items (2)

On spectral radius of the generalized distance matrix of a graph ⋮ On the eigenvalues and spread of the generalized distance matrix of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two Laplacians for the distance matrix of a graph
• 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
• A sharp upper bound on the maximal entry in the principal eigenvector of symmetric nonnegative matrix
• The Randić index and signless Laplacian spectral radius of graphs
• The generalized distance matrix
• Bounds on maximal and minimal entries of the \(p\)-normalized principal eigenvector of the distance and distance signless Laplacian matrices of graphs
• On maximal entries in the principal eigenvector of graphs
• On the second largest eigenvalue of the generalized distance matrix of graphs
• On the sum of the powers of distance signless Laplacian eigenvalues of graphs
• Distance spectra of graphs: a survey
• Sharp bounds on the spectral radius of a nonnegative matrix
• On the distance and distance signless Laplacian spectral radii of bicyclic graphs
• On the distance signless Laplacian spectral radius of graphs
• A necessary and sufficient eigenvector condition for a connected graph to be bipartite
• Further results on the distance signless Laplacian spectrum of graphs
• The distance spectral radius of trees
• On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity
• On distance spectral radius of hypergraphs
• On the sum of the generalized distance eigenvalues of graphs
• On the bounds of maximal entries in the principal eigenvector of symmetric nonnegative matrix

This page was built for publication: Bounds for Generalized Distance Spectral Radius and the Entries of the Principal Eigenvector