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

5 papers · 1 filter

math.CO2015

Graphs that are simultaneously efficient open domination and efficient closed domination graphs

Sandi Klavzar, Iztok Peterin, Ismael G. Yero

A graph is an efficient open (resp.\ closed) domination graph if there exists a subset of vertices whose open (resp.\ closed) neighborhoods partition its vertex set. Graphs that ar…

math.CO2015★ 14 cited

Spectra of Graphs and Closed Distance Magic Labelings

Marcin Anholcer, Sylwia Cichacz, Iztok Peterin

Let $G = (V, E)$ be a graph of order $n$ . A closed distance magic labeling of $G$ is a bijection $ℓ : V (G) \to {1, \dots, n}$ for which there exists a positive intege…

math.CO2015

Resolvability and Strong Resolvability in the Direct Product of Graphs

Dorota Kuziak, Iztok Peterin, Ismael G. Yero

Given a connected graph $G$ , a vertex $w \in V (G)$ distinguishes two different vertices $u, v$ of $G$ if the distances between $w$ and $u$ and between $w$ and $v$ are different. More…

math.CO2015★ 2 cited

Partitioning the vertex set of $G$ to make $G □ H$ an efficient open domination graph

Tadeja Kraner Šumenjak, Iztok Peterin, Douglas F. Rall +1

A graph is an efficient open domination graph if there exists a subset of vertices whose open neighborhoods partition its vertex set. We characterize those graphs $G$ for which the…

math.CO2015★ 5 cited

Open k-monopolies in graphs: complexity and related concepts