83 citations · 248 across the 19 of their papers we have counts for
23 papers
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…
Optimal algorithm for computing Steiner 3-eccentricities of trees
Aleksandar Ilic
The Steiner -eccentricity of a vertex of a graph is the maximum Steiner distance over all -subsets of which contain . In this note, we design a linear algo…
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…
Path matrix and path energy of graphs
Aleksandar Ilic, Milan Basic
Given a graph , we associate a path matrix whose entry represents the maximum number of vertex disjoint paths between the vertices and , with zeros on the ma…
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…