On graphs with exactly one anti-adjacency eigenvalue and beyond

Jianfeng Wang, Xingyu Lei, Mei Lu +2

The anti-adjacency matrix of a graph is constructed from the distance matrix of a graph by keeping each row and each column only the largest distances. This matrix can be interpret…