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

4 papers · 1 filter

math.CO2018★ 16 cited

On three outer-independent domination related parameters in graphs

Doost Ali Mojdeh, Iztok Peterin, Babak Samadi +1

Let $G$ be a graph and let $S \subseteq V (G)$ . The set $S$ is a double outer-independent dominating set of $G$ if $∣ N [v] \cap D ∣ \geq 2$ , for all $v \in V (G)$ , and $V (G) ∖ S$ is…

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.CO2018

Edge metric dimension of some graph operations

Iztok Peterin, Ismael G. Yero

Let $G = (V, E)$ be a connected graph. Given a vertex $v \in V$ and an edge $e = u w \in E$ , the distance between $v$ and $e$ is defined as $d_{G} (e, v) = min {d_{G} (u, v), d_{G} (w, v)}$ . A nonempt…

math.CO2018

Efficient closed domination in digraph products

Iztok Peterin, Ismael G. Yero

A digraph $D$ is an efficient closed domination digraph if there exists a subset $S$ of $V (D)$ for which the closed out-neighborhoods centered in vertices of $S$ form a partition o…