Jozef J. Kratica

activity

20182020

most citedAn Integer Linear Programming Formulation for the Convex Dominating Set Problems

4 citations · 6 across the 2 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2020★ 2 cited

Some new general lower bounds for mixed metric dimension of graphs

Milica Milivojević Danas, Jozef Kratica, Aleksandar Savić +1

Let $G = (V, E)$ be a connected simple graph. The distance $d (u, v)$ between vertices $u$ and $v$ from $V$ is the number of edges in the shortest $u - v$ path. If $e = uv \in E$ is an edge…

math.CO2018

Edge metric dimension of some generalized Petersen graphs

Vladimir Filipovic. Aleksandar Kartelj, Jozef Kratica

The edge metric dimension problem was recently introduced, which initiated the study of its mathematical properties. The theoretical properties of the edge metric representations a…

math.CO2018

Some properties of ${k}$ -packing function problem in graphs

Jozef J. Kratica, Aleksandar Lj. Savić, Zoran Lj. Maksimović

The recently introduced ${k}$ -packing function problem is considered in this paper. Special relation between a case when $k = 1$ , $k \geq 2$ and linear programming relaxation is intr…

Some new general lower bounds for mixed metric dimension of graphs

Edge metric dimension of some generalized Petersen graphs

Some properties of {k}-packing function problem in graphs

Some properties of ${k}$ -packing function problem in graphs