Distance spectral radius of the complements of trees with fixed parameters

Kang Liu, Dan Li, Yuanyuan Chen and Yuanjing Li

Applied Mathematics and Computation, 2023, vol. 443, issue C

Abstract: Let G be a simple connected graph and Gc be the complement of G. Denote by dG(u,v) the distance between the vertices u and v which is the length of the shortest path between u and v in G. Let D(G)=(dG(u,v))n×n be the distance matrix of G and λ1(D(G)) denote the distance spectral radius of G. In this paper, we characterize the unique graphs with maximum distance spectral radius among all the complements of trees of order n with fixed maximum degree, pendent vertices, diameter and perfect matchings, respectively.

Keywords: Extremal graph; The complement of graphs; Distance matrix; Distance spectral radius (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322008578
Full text for ScienceDirect subscribers only

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:eee:apmaco:v:443:y:2023:i:c:s0096300322008578

DOI: 10.1016/j.amc.2022.127789

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().