I. G. Yero

activity

20062026

most citedOn the metric dimension of corona product graphs

149 citations · 707 across the 83 of their papers we have counts for

collaborators

Showing 2016Show all

7 papers · 1 filter

math.CO2016★ 1 cited

Strong resolving graphs: the realization and the characterization problems

D. Kuziak, M. L. Puertas, J. A. Rodriguez-Velazquez +1

The strong resolving graph $G_{S R}$ of a connected graph $G$ was introduced in [Discrete Applied Mathematics 155 (1) (2007) 356--364] as a tool to study the strong metric dimension…

math.CO2016

Mixed metric dimension of graphs

Aleksander Kelenc, Dorota Kuziak, Andrej Taranenko +1

Let $G = (V, E)$ be a connected graph. A vertex $w \in V$ distinguishes two elements (vertices or edges) $x, y \in E \cup V$ if $d_{G} (w, x) \neq = d_{G} (w, y)$ . A set $S$ of vertices in a connecte…

math.CO2016★ 15 cited

The fractional strong metric dimension in three graph products

Cong X. Kang, Ismael G. Yero, Eunjeong Yi

For any two distinct vertices $x$ and $y$ of a graph $G$ , let $S {x, y}$ denote the set of vertices $z$ such that either $x$ lies on a $y - z$ geodesic or $y$ lies on an $x - z$ geode…

cs.CC2016★ 2 cited

On the Computational Complexities of Three Privacy Measures for Large Networks Under Active Attack

Tanima Chatterjee, Bhaskar DasGupta, Nasim Mobasheri +2

With the arrival of modern internet era, large public networks of various types have come to existence to benefit the society as a whole and several research areas such as sociolog…

math.CO2016★ 7 cited

The k-metric dimension of graphs: a general approach

A. Estrada-Moreno, I. G. Yero, J. A. Rodriguez-Velazquez

Let $(X, d)$ be a metric space. A set $S \subseteq X$ is said to be a $k$ -metric generator for $X$ if and only if for any pair of different points $u, v \in X$ , there exist at least $k…

math.CO2016

Error-correcting codes from $k$ -resolving sets

Robert F. Bailey, Ismael G. Yero

We demonstrate a construction of error-correcting codes from graphs by means of $k$ -resolving sets, and present a decoding algorithm which makes use of covering designs. Along the…