首页|Spectral determination of graphs with one positive anti-adjacency eigenvalue
Spectral determination of graphs with one positive anti-adjacency eigenvalue
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
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.(C) 2022 Elsevier Inc. All rights reserved.
NSTL
Elsevier
