2 citations · 2 across the 2 of their papers we have counts for
4 papers · 1 filter
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…
On the graphs having at most one positive eccentricity eigenvalue
Sezer Sorgun, Hakan Küçük
The eccentricity (anti-adjacency) matrix of a graph is obtained from the distance matrix by retaining the eccentricities in each row and each column. This matr…
On the spectral characterization of mixed extensions of
Willem H. Haemers, Sezer Sorgun, Hatice Topcu
A mixed extension of a graph is a graph obtained from by replacing each vertex of by a clique or a coclique, whilst two vertices in corresponding to distinct ve…
On the spectral characterization of Kite graphs
Sezer Sorgun, Hatice Topcu
The \textit{Kite graph}, denoted by is obtained by appending a complete graph to a pendant vertex of a path . In this paper, firstly we show that no two…