Aleksander Kelenc

activity

20162024

most citedOn Metric Dimensions of Hypercubes

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

collaborators

7 papers

math.CO2024★ 1 cited

On Distance and Strong Metric Dimension of the Modular Product

Cong X. Kang, Aleksander Kelenc, Iztok Peterin +1

The modular product $G ⋄ H$ of graphs $G$ and $H$ is a graph on vertex set $V (G) \times V (H)$ . Two vertices $(g, h)$ and $(g^{'}, h^{'})$ of $G ⋄ H$ are adjacent if $g = g^{'}$ and $…

math.CO2023

Maker-Breaker Strong Resolving Game

Cong X. Kang, Aleksander Kelenc, Eunjeong Yi

Let $G$ be a graph with vertex set $V$ . A set $S \subseteq V$ is a \emph{strong resolving set} of $G$ if, for distinct $x, y \in V$ , there exists $z \in S$ such that either $x$ lies o…

math.CO2021★ 1 cited

On Metric Dimensions of Hypercubes

Aleksander Kelenc, Aoden Teo Masa Toshi, Riste Skrekovski +1

The metric (resp. edge metric or mixed metric) dimension of a graph $G$ , is the cardinality of the smallest ordered set of vertices that uniquely recognizes all the pairs of distin…

math.CO2019

Determining the Hausdorff Distance Between Trees in Polynomial Time

Aleksander Kelenc

The Hausdorff distance is a relatively new measure of similarity of graphs. The notion of the Hausdorff distance considers a special kind of a common subgraph of the compared graph…

math.CO2018

Incidence dimension and 2-packing number in graphs

Dragana Bozovic, Aleksander Kelenc, Iztok Peterin +1

Let $G = (V, E)$ be a graph. A set of vertices $A$ is an incidence generator for $G$ if for any two distinct edges $e, f \in E (G)$ there exists a vertex from $A$ which is an endpoint of…

math.CO2016

Mixed metric dimension of graphs

Aleksander Kelenc, Dorota Kuziak, Andrej Taranenko +1

Let $G = (V, E)$ be a connected graph. A vertex $w \in V$ distinguishes two elements (vertices or edges) $x, y \in E \cup V$ if $d_{G} (w, x) \neq = d_{G} (w, y)$ . A set $S$ of vertices in a connecte…

math.CO2016

Uniquely identifying the edges of a graph: the edge metric dimension

Aleksander Kelenc, Niko Tratnik, Ismael G. Yero

Let $G = (V, E)$ be a connected graph, let $v \in V$ be a vertex and let $e = u w \in E$ be an edge. The distance between the vertex $v$ and the edge $e$ is given by $d_G(e,v)=\min\{d_G(u,…