149 citations · 294 across the 29 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.CO2015★ 8 cited
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 $…
math.CO2015
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…
math.CO2015★ 5 cited
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…