149 citations · 707 across the 83 of their papers we have counts for
5 papers · 1 filter
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…
On the strong metric dimension of Cartesian sum graphs
Dorota Kuziak, Ismael G. Yero, Juan A. Rodríguez-Velázquez
A vertex of a connected graph strongly resolves two vertices , if there exists some shortest path containing or some shortest path containing $…
Resolvability and Strong Resolvability in the Direct Product of Graphs
Dorota Kuziak, Iztok Peterin, Ismael G. Yero
Given a connected graph , a vertex distinguishes two different vertices of if the distances between and and between and are different. More…
Open k-monopolies in graphs: complexity and related concepts
Dorota Kuziak, Iztok Peterin, Ismael G. Yero
Closed monopolies in graphs have a quite long range of applications in several problems related to overcoming failures, since they frequently have some common approaches around the…
On the Strong Roman Domination Number of Graphs
M. P. Alvarez-Ruiz, I. Gonzalez Yero, T. Mediavilla-Gradolph +2
Based on the history that the Emperor Constantine decreed that any undefended place (with no legions) of the Roman Empire must be protected by a "stronger" neighbor place (having t…