On Pareto eigenvalue of distance matrix of a graph

Deepak Sarma ()
Additional contact information
Deepak Sarma: Assam Agricultural University

Indian Journal of Pure and Applied Mathematics, 2021, vol. 52, issue 4, 1021-1037

Abstract: 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 n largest distance Pareto eigenvalues of a connected graph of order n. Finally, we discuss some bounds for the second largest distance Pareto eigenvalue and find graphs with optimal second largest distance Pareto eigenvalue.

Keywords: Pareto eigenvalue; Distance matrix; Spectral radius; 05C50; 05C12 (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13226-021-00104-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:indpam:v:52:y:2021:i:4:d:10.1007_s13226-021-00104-w

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/13226

DOI: 10.1007/s13226-021-00104-w

Access Statistics for this article

Indian Journal of Pure and Applied Mathematics is currently edited by Nidhi Chandhoke

More articles in Indian Journal of Pure and Applied Mathematics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().