Aleksandar Ilic

activity

20112026

most citedOn the computational complexity of the Steiner

k

-eccentricity

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

Further results on the lower bound on reduced Zagreb index of trees

Milan Bašić, Aleksandar Ilić

For a graph $G$ , the general reduced second Zagreb index is defined as $GR M_{λ} (G) = uv \in E \sum (d e g (u) + λ) (d e g (v) + λ),$ where $λ$ is an arbitrary real number and $d e g (v)$ …

math.CO2021★ 1 cited

On the computational complexity of the Steiner $k$ -eccentricity

Xingfu Li, Guihai Yu, Aleksandar Ilić +1

The Steiner $k$ -eccentricity of a vertex $v$ of a graph $G$ is the maximum Steiner distance over all $k$ -subsets of $V (G)$ which contain $v$ . A linear time algorithm for calculati…

math.CO2011

On comparing Zagreb indices

Aleksandar Ilić, Dragan Stevanović

Let $G = (V, E)$ be a simple graph with $n = ∣ V ∣$ vertices and $m = ∣ E ∣$ edges. The first and second Zagreb indices are among the oldest and the most famous topological indices, defin…

math.CO2011

All pentagonal face multi tori

Mircea V. Diudea, Aleksandar Ilić

Design of monomeric unit, by using sequences of map operations, and the growing process in the building of a double-shell multi torus with all-pentagonal faces, is presented. It is…

Further results on the lower bound on reduced Zagreb index of trees

On the computational complexity of the Steiner k-eccentricity

On comparing Zagreb indices

All pentagonal face multi tori

On the computational complexity of the Steiner $k$ -eccentricity