7 papers
Cospectrality results for signed graphs with two eigenvalues unequal to
Willem H. Haemers, Hatice Topcu
Recently the collection of all signed graphs for which the adjacency matrix has all but at most two eigenvalues equal to has been determined. Here we investigate $…
The signed graphs with two eigenvalues unequal to
Willem Haemers, Hatice Topcu
We complete the determination of the signed graphs for which the adjacency matrix has all but at most two eigenvalues equal to . The unsigned graphs and the disconnected, th…
On signed graphs with at most two eigenvalues unequal to
Willem H. Haemers, Hatice Topcu
We present the first steps towards the determination of the signed graphs for which the adjacency matrix has all but at most two eigenvalues equal to 1 or -1. Here we deal with the…
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…
The Kite Graph is Determined by Its Adjacency Spectrum
Sezer Sorgun, Hatice Topcu
The Kite graph is obtained by appending the complete graph to a pendant vertex of the path . In this paper, the kite graph is proved to be determined…
On the spectral characterization of pineapple graphs
Hatice Topcu, Sezer Sorgun, Willem H. Haemers
The pineapple graph is obtained by appending pendant edges to a vertex of a complete graph (). Zhang and Zhang ["Some graphs determined by th…
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…