149 citations · 707 across the 83 of their papers we have counts for
8 papers · 1 filter
On the strong partition dimension of graphs
Ismael Gonzalez Yero
We present a different way to obtain generators of metric spaces having the property that the ``position'' of every element of the space is uniquely determined by the distances fro…
The k-metric dimension of a graph
Alejandro Estrada-Moreno, Juan A. Rodríguez-Velázquez, Ismael G. Yero
As a generalization of the concept of a metric basis, this article introduces the notion of -metric basis in graphs. Given a connected graph , a set is s…
Strong metric dimension of rooted product graphs
Dorota Kuziak, Ismael G. Yero, Juan A. Rodríguez-Velázquez
Let be a connected graph. A vertex strongly resolves a pair , of vertices of if there exists some shortest path containing or some shortest path…
Computing the metric dimension of a graph from primary subgraphs
D. Kuziak, J. A. Rodríguez-Velázquez, I. G. Yero
Let be a connected graph. Given an ordered set and a vertex , the representation of with respect to is the ordered…
Defensive alliances in graphs: a survey
Ismael González Yero, Juan A. Rodríguez-Velázquez
A set of vertices of a graph is a defensive -alliance in if every vertex of has at least more neighbors inside of than outside. This is primarily an expo…
On the strong metric generators of strong product graphs
Dorota Kuziak, Ismael G. Yero, Juan A. Rodríguez-Velázquez
Let be a connected graph. A vertex strongly resolves two vertices if there exists some shortest path containing or some shortest path…