11 citations · 14 across the 9 of their papers we have counts for
4 papers · 1 filter
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 the Second-Order Wiener Ratios of Iterated Line Graphs
Mohammad Ghebleh, Ali Kanso
The Wiener index W(G) of a graph G is the sum of distances between all unordered pairs of its vertices. Dobrynin and Mel'nikov [in: Distance in Molecular Graphs - Theory, 2012, p.…
Searching for regular, triangle-distinct graphs
Dragan Stevanović, Mohammad Ghebleh, Gilles Caporossi +2
The triangle-degree of a vertex v of a simple graph G is the number of triangles in G that contain v. A simple graph is triangle-distinct if all its vertices have distinct triangle…