11 citations · 14 across the 9 of their papers we have counts for
9 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 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…
Totally Silver Graphs
M. Ghebleh, E. S. Mahmoodian
A totally silver coloring of a graph G is a k--coloring of G such that for every vertex v \in V(G), each color appears exactly once on N[v], the closed neighborhood of v. A totally…
Locating and Identifying Codes in Circulant Networks
M. Ghebleh, L. Niepel
A set S of vertices of a graph G is a dominating set of G if every vertex u of G is either in S or it has a neighbour in S. In other words, S is dominating if the sets S\cap N[u] w…
On the Set of Circular Total Chromatic Numbers of Graphs
Mohammad Ghebleh
For every integer and every $\eps>0$ we construct a graph with maximum degree whose circular total chromatic number is in the interval $(r,r+\eps)$. This proves that…
On uniquely list colorable graphs
M. Ghebleh, E. S. Mahmoodian
Let G be a graph with n vertices and suppose that for each vertex v in G, there exists a list of k colors L(v), such that there is a unique proper coloring for G from this collecti…
Uniquely 2-List Colorable Graphs
Y. G. Ganjali, M. Ghebleh, H. Hajiabolhassan +2
A graph is called to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on…