5 papers
A polynomial GCD certificate for exact flat bands in finite-range Bloch Hamiltonians
Ivan DamnjanoviÄ, Milan DamnjanoviÄ, Ivanka MiloÅ¡eviÄ +1
We formulate a polynomial GCD certificate for exact flat bands in finite-range periodic tight-binding Hamiltonians. Writing the characteristic polynomial of the Bloch Hamiltonian a…
RLGT: A reinforcement learning framework for extremal graph theory
Ivan DamnjanoviÄ, UroÅ¡ MilivojeviÄ, Irena ÄorÄeviÄ +1
Reinforcement learning (RL) is a subfield of machine learning that focuses on developing models that can autonomously learn optimal decision-making strategies over time. In a recen…
Some bounds on the spectral radius of connected threshold graphs
Péter Csikvári, Ivan DamnjanoviÄ, Dragan StevanoviÄ +1
The spectral radius of a graph is the spectral radius of its adjacency matrix. A threshold graph is a simple graph whose vertices can be ordered as , so that…
Metaheuristics for finding threshold graphs with maximum spectral radius
Luka RadanoviÄ, Abdelkadir Fellague, Dragutin OstojiÄ +2
We consider the problem of characterizing graphs with the maximum spectral radius among the connected graphs with given numbers of vertices and edges. It is well-known that the can…
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…