Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Topçu, Hatice"'
Autor:
Haemers, Willem, Topcu, Hatice
We complete the determination of the signed graphs for which the adjacency matrix has all but at most two eigenvalues equal to $\pm 1$. The unsigned graphs and the disconnected, the bipartite and the complete signed graphs with this property have alr
Externí odkaz:
http://arxiv.org/abs/2301.01623
Autor:
Haemers, Willem H., Topcu, Hatice
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 disconnected, the bipartite and the complete signed graphs. In additi
Externí odkaz:
http://arxiv.org/abs/2109.02522
Autor:
Haemers, Willem H., Topcu, Hatice
Publikováno v:
In Applied Mathematics and Computation 15 February 2024 463
Autor:
Haemers, Willem H., Topcu, Hatice
Publikováno v:
In Linear Algebra and Its Applications 1 August 2023 670:68-77
A mixed extension of a graph $G$ is a graph $H$ obtained from $G$ by replacing each vertex of $G$ by a clique or a coclique, whilst two vertices in $H$ corresponding to distinct vertices $x$ and $y$ of $G$ are adjacent whenever $x$ and $y$ are adjace
Externí odkaz:
http://arxiv.org/abs/1810.12615
Autor:
Sorgun, Sezer, Topcu, Hatice
The Kite graph $Kite_{p}^{q}$ is obtained by appending the complete graph $K_{p}$ to a pendant vertex of the path $P_{q}$. In this paper, the kite graph is proved to be determined by the spectrum of its adjacency matrix.
Comment: 14 pages, 7 fig
Comment: 14 pages, 7 fig
Externí odkaz:
http://arxiv.org/abs/1701.06400
The pineapple graph $K_p^q$ is obtained by appending $q$ pendant edges to a vertex of a complete graph $K_{p}$ ($q\geq 1,\ p\geq 3$). Zhang and Zhang ["Some graphs determined by their spectra", Linear Algebra and its Applications, 431 (2009) 1443-145
Externí odkaz:
http://arxiv.org/abs/1511.08674
Autor:
Sorgun, Sezer, Topcu, Hatice
The \textit{Kite graph}, denoted by $Kite_{p,q}$ is obtained by appending a complete graph $K_{p}$ to a pendant vertex of a path $P_{q}$. In this paper, firstly we show that no two non-isomorphic kite graphs are cospectral w.r.t adjacency matrix. Let
Externí odkaz:
http://arxiv.org/abs/1506.01632
Publikováno v:
In Discrete Applied Mathematics 30 September 2019 269:52-59
Autor:
ARIK, Yunus Emre, TOPÇU, Hatice
Publikováno v:
Balikesir Health Sciences Journal / Balıkesir Sağlık Bilimleri Dergisi; Dec2023, Vol. 12 Issue 3, p571-578, 8p