Spectral determination of graphs with one positive anti-adjacency eigenvalue

Xingyu Lei and Jianfeng Wang

Applied Mathematics and Computation, 2022, vol. 422, issue C

Abstract: The anti-adjacency matrix (or eccentricity matrix) of a graph is obtained from its distance matrix by retaining for each row and each column only the largest distances. This matrix can be viewed as the opposite of the adjacency matrix, which is, on the contrary, obtained from the distance matrix of a graph by keeping for each row and each column only the distances being 1. In this paper, we prove that the graphs with exactly one positive anti-adjacency eigenvalue are determined by the anti-adjacency spectra. As corollaries, the well-known (generalized) friendship graphs and windmill graphs are shown to be determined by their anti-adjacency spectra.

Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322000819
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:422:y:2022:i:c:s0096300322000819

DOI: 10.1016/j.amc.2022.126995

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 ().