83 citations · 248 across the 19 of their papers we have counts for
16 papers · 1 filter
Maximal diameter of integral circulant graphs
Milan Bašić, Aleksandar Ilić, Aleksandar Stamenković
Integral circulant graphs are proposed as models for quantum spin networks that permit a quantum phenomenon called perfect state transfer. Specifically, it is important to know how…
On conjectures of network distance measures by using graph spectra
Aleksandar Ilic, Matthias Dehmer
In this note we resolve three conjectures from [M. Dehmer, S. Pickl, Y. Shi, G. Yu, \emph{New inequalities for network distance measures by using graph spectra}, Discrete Appl. Mat…
Comparing Wiener complexity with eccentric complexity
Kexiang Xu, Aleksandar Ilić, Vesna Iršič +2
The transmission of a vertex of a graph is the sum of distances from to all the other vertices in . The Wiener complexity of is the number of different transmiss…
Counterexamples to conjectures on graph distance measures based on topological indexes
Aleksandar Ilic, Milovan Ilic
In this paper we disprove three conjectures from [M. Dehmer, F. Emmert-Streib, Y. Shi, Interrelations of graph distance measures based on topological indices, PLoS ONE 9 (2014) e94…
A note on 'A New Approach To Compute Wiener Index'
Aleksandar Ilic
In this note, we discuss the method explained in the recent paper [P. Manuel, I. Rajasingh, B. Rajan, R. Sundara Rajan, A New Approach To Compute Wiener Index, Journal of Computati…
Note on the harmonic index of a graph
Aleksandar Ilic
The harmonic index of a graph is defined as the sum of weights of all edges of , where denotes the degree of a vertex in $…