On Pareto eigenvalue of distance matrix of a graph
From MaRDI portal
Publication:2065372
Abstract: In this article, we study Pareto eigenvalues of distance matrix of connected graphs and show that the non zero entries of every distance Pareto eigenvector of a tree forms a strictly convex function on the forest generated by the vertices corresponding to the non zero entries of the vector. Besides we find the minimum number of possible distance Pareto eigenvalue of a connected graph and establish lower bounds for largest distance Pareto eigenvalues of a connected graph of order Finally, we discuss some bounds for the second largest distance Pareto eigenvalue and find graphs with optimal second largest distance Pareto eigenvalue.
Recommendations
Cites work
This page was built for publication: On Pareto eigenvalue of distance matrix of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2065372)