1 citations · 1 across the 3 of their papers we have counts for
4 papers
Reinforcement learning for graph theory, I. Reimplementation of Wagner's approach
Mohammad Ghebleh, Salem Al-Yakoob, Ali Kanso +1
We reimplement here the recent approach of Adam Zsolt Wagner [arXiv:2104.14516], which applies reinforcement learning to construct (counter)examples in graph theory, in order to ma…
Reinforcement learning for graph theory, II. Small Ramsey numbers
Mohammad Ghebleh, Salem Al-Yakoob, Ali Kanso +1
We describe here how the recent Wagner's approach for applying reinforcement learning to construct examples in graph theory can be used in the search for critical graphs for small…
On Hosoya's dormants and sprouts
Salem Al-Yakoob, Ali Kanso, Dragan Stevanović
In a recent series of papers, Hosoya drew the attention to a particular aspect of constructing cospectral graphs by using coalescences: that cospectral graphs can be constructed by…
On interval transmission irregular graphs
Salem Al-Yakoob, Dragan Stevanovic
Transmission of a vertex v of a connected graph G is the sum of distances from v to all other vertices in G. Graph G is transmission irregular (TI) if no two of its vertices have t…