Closeness spectra and structural uniqueness of special graph classes
Qaisar Farhad,
Mumtaz Hussain and
Shou-Jun Xu
Applied Mathematics and Computation, 2026, vol. 509, issue C
Abstract:
For a graph G with vertex set V(G) and edge set E(G). Let d(u,v) be the distance between vertices u and v. The closeness matrix of a graph G is a symmetric matrix, where each entry cG(u,v) is defined as cG(u,v)=2−d(u,v) for u≠v, and cG(u,v)=0, if u=v. In the present study, we investigate the closeness spectra of connected graphs and inquire whether specific graph classes may be distinguished by their closeness eigenvalues. We inspect the tree T3,n−3, the path Pn, the complete graph Kn, and the join graph (P1∪P3)∨Kn−4‾. Applying careful spectral computation, we demonstrate that such graphs are uniquely specified by their closeness spectra. Additionally, we confirm that the tree T3,n−3 achieves the second-smallest closeness eigenvalue among trees of diameter 3. Our findings emphasize the importance of closeness matrices in spectral graph theory and lead to more clarity of the relationship between the structure of graphs and its spectrum.
Keywords: Closeness; Closeness matrix; Closeness eigenvalue (search for similar items in EconPapers)
Date: 2026
References: Add references at CitEc
Citations:
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300325003923
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:509:y:2026:i:c:s0096300325003923
DOI: 10.1016/j.amc.2025.129666
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 ().