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 2019Show all

3 papers · 1 filter

math.CO2019

A note on bipartite graphs whose [1, k]-domination number equal to their number of vertices

Narges Ghareghani, Iztok Peterin, Pouyeh Sharifani

A subset $D$ of the vertex set $V$ of a graph $G$ is called an $[1, k]$ -dominating set if every vertex from $V - D$ is adjacent to at least one vertex and at most $k$ vertices of $D$ .…

math.CO2019

A note on the packing chromatic number of lexicographic products

Dragana Božović, Iztok Peterin

The packing chromatic number $χ_{ρ} (G)$ of a graph $G$ is the smallest integer $k$ such that there exists a $k$ -vertex coloring of $G$ in which any two vertices receiving color $i$ a…

math.CO2019★ 1 cited

(Open) packing number of some graph products

Doost Ali Mojdeh, Iztok Peterin, Babak Samadi +1

The packing number of a graph $G$ is the maximum number of closed neighborhoods of vertices in $G$ with pairwise empty intersections. Similarly, the open packing number of $G$ is t…