Iztok Peterin

activity

20122026

most citedDistance magic labeling and two products of graphs

20 citations · 67 across the 25 of their papers we have counts for

collaborators

Showing 2024Show all

4 papers · 1 filter

math.CO2024

Grundy Packing Coloring of Graphs

Didem Gözüpek, Iztok Peterin

A map $c : V (G) \to {1, \dots, k}$ of a graph $G$ is a packing $k$ -coloring if every two different vertices of the same color $i \in {1, \dots, k}$ are at distance more than $i$ …

math.CO2024★ 1 cited

Convex Geometries yielded by Transit Functions

Manoj Changat, Lekshmi Kamal K. Sheela, Iztok Peterin +1

Let $V$ be a finite nonempty set. A transit function is a map $R : V \times V \to 2^{V}$ such that $R (u, u) = {u}$ , $R (u, v) = R (v, u)$ and $u \in R (u, v)$ hold for every $u, v \in V$ . A…

math.CO2024

Domination number of modular product graphs

Sergio Bermudo, Iztok Peterin, Jelena Sedlar +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…

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 $…