activity
20112025
most citedOn the Wiener index and Laplacian coefficients of graphs with given diameter or radius

20 citations · 24 across the 4 of their papers we have counts for

collaborators

6 papers

math.CO2025★ 3 cited

Classification of borderenergetic chemical graphs and borderenergetic graphs of order 12

Péter Csikvári, Ivan Damnjanović, Marko Milošević +2

The energy of a simple graph is the sum of absolute values of the eigenvalues of its adjacency matrix. A borderenergetic graph of order is any noncomp…

math.CO2024★ 1 cited

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…

math.CO2020

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…

math.SP2018

Eigenvector-based identification of bipartite subgraphs

Debdas Paul, Dragan Stevanovic

We report our experiments in identifying large bipartite subgraphs of simple connected graphs which are based on the sign pattern of eigenvectors belonging to the extremal eigenval…

math.CO2011★ 20 cited

On the Wiener index and Laplacian coefficients of graphs with given diameter or radius

Aleksandar Ilic, Andreja Ilic, Dragan Stevanovic

Let be a simple undirected -vertex graph with the characteristic polynomial of its Laplacian matrix , . It is we…

cs.DM2011

Constructions of hamiltonian graphs with bounded degree and diameter O (log n)

Aleksandar Ili\' c, Dragan Stevanovi\' c

Token ring topology has been frequently used in the design of distributed loop computer networks and one measure of its performance is the diameter. We propose an algorithm for con…