A. Estrada-Moreno

activity

20132026

most citedThe k-metric dimension of a graph

79 citations · 108 across the 12 of their papers we have counts for

collaborators

Showing math.COShow all

15 papers · 1 filter

math.CO2026

The Equidistant Dimension of Corona Product Graphs

Sandor E. Tuñón-Andrés, Alejandro Estrada-Moreno, Juan A. Rodríguez-Velázquez

A subset $S$ of vertices, in a connected graph $G$ , is called a distance-equalizer set if for every pair of distinct vertices outside $S$ , there exists a vertex in $S$ equidistant…

math.CO2025

On the $(k, ℓ)$ -multiset anonymity measure for social graphs

Alejandro Estrada-Moreno, Elena Fernández, Dorota Kuziak +3

The publication of social graphs must be preceded by a rigorous analysis of privacy threats against social graph users. When the threat comes from inside the social network itself,…

math.CO2021

From (secure) w-domination in graphs to protection of lexicographic product graphs

Abel Cabrera Martinez, Alejandro Estrada Moreno, Juan Alberto Rodriguez-Velazquez

Let $w = (w_{0}, w_{1}, \dots, w_{l})$ be a vector of nonnegative integers such that $w_{0} \geq 1$ . Let $G$ be a graph and $N (v)$ the open neighbourhood of $v \in V (G)$ . We say that a function…

math.CO2020★ 3 cited

From Italian domination in lexicographic product graphs to w-domination in graphs

A. Cabrera Martinez, A. Estrada-Moreno, J. A. Rodriguez-Velazquez

In this paper, we show that the Italian domination number of every lexicographic product graph $G \circ H$ can be expressed in terms of five different domination parameters of $G$ .…

math.CO2018

On the $k$ -partition dimension of graphs

Alejandro Estrada-Moreno

As a generalization of the concept of the partition dimension of a graph, this article introduces the notion of the $k$ -partition dimension. Given a nontrivial connected graph $G=(…

math.CO2016

On distances in generalized Sierpinski graphs

Alejandro Estrada-Moreno, Erick D. Rodriguez-Bazan, Juan A. Rodriguez-Velazquez

In this paper we propose formulas for the distance between vertices of a generalized Sierpiński graph $S (G, t)$ in terms of the distance between vertices of the base graph $G$ . In p…

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

The local metric dimension of the lexicographic product of graphs

G. A. Barragán-Ramírez, A. Estrada-Moreno, Y. Ramírez-Cruz +1

The metric dimension is quite a well-studied graph parameter. Recently, the adjacency dimension and the local metric dimension have been introduced and studied. In this paper, we g…

math.CO2015

On the General Randić index of polymeric networks modelled by generalized Sierpiński graphs

Alejandro Estrada-Moreno, Juan A. Rodríguez-Velázquez

The General Randić index $R_{α}$ of a simple graph $G$ is defined as \[ R_α(G)=\sum_{v_{i}\sim v_{j}} (δ_{i}δ_{j})^α, \] where $δ_{i}$ denotes the degree of the vertex $v_{i}$ . Rodríguez…

math.CO2015★ 1 cited

On Generalized Sierpiński Graphs

Juan A. Rodríguez-Velázquez, Erick D. Rodríguez-Bazan, Alejandro Estrada-Moreno

In this paper we obtain closed formulae for several parameters of generalized Sierpiński graphs $S (G, t)$ in terms of parameters of the base graph $G$ . In particular, we focus on th…

math.CO2015★ 3 cited

Simultaneous Resolvability in Families of Corona Product Graphs

Yunior Ramírez-Cruz, Alejandro Estrada-Moreno, Juan A. Rodríguez-Velázquez

Let $G$ be a graph family defined on a common vertex set $V$ and let $d$ be a distance defined on every graph $G \in G$ . A set $S \subset V$ is said to be a simultaneou…

math.CO2015★ 9 cited

The Simultaneous Metric Dimension of Families Composed by Lexicographic Product Graphs

Yunior Ramirez-Cruz, Alejandro Estrada-Moreno, Juan A. Rodriguez-Velazquez

Let $G$ be a graph family defined on a common (labeled) vertex set $V$ . A set $S \subseteq V$ is said to be a simultaneous metric generator for $G$ if for every $G…

math.CO2014★ 1 cited

The $k$ -metric dimension of corona product graphs

Alejandro Estrada-Moreno, Ismael Gonzalez Yero, Juan Alberto Rodriguez-Velazquez

Given a connected simple graph $G = (V, E)$ , and a positive integer $k$ , a set $S \subseteq V$ is said to be a $k$ -metric generator for $G$ if and only if for any pair of different ver…

math.CO2014★ 5 cited

On the complexity of computing the $k$ -metric dimension of graphs

Ismael G. Yero, Alejandro Estrada-Moreno, Juan A. Rodriguez-Velazquez

Given a connected graph $G = (V, E)$ , a set $S \subseteq V$ is a $k$ -metric generator for $G$ if for any two different vertices $u, v \in V$ , there exist at least $k$ vertices $w_1,...,w…

math.CO2013★ 79 cited

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 $k$ -metric basis in graphs. Given a connected graph $G = (V, E)$ , a set $S \subseteq V$ is s…