Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Alejandro Estrada-Moreno has a total of 46 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

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

    by Alejandro Estrada-Moreno, Elena Fernández, Dorota Kuziak, Manuel Muñoz-Márquez, Rolando Trujillo-Rasua, Ismael G. Yero

    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, the threat is called an active attack, and the de-facto privacy measure used to quantify the resistance to such an attack is the $(k,\ell)$-anonymity. The original formulation of $(k,\ell)$-anonymity represents the adversary's knowledge as a vector of distances to the set of attacker nodes. In this article, we argue that such adversary is too strong when it comes to counteracting active attacks. We, instead, propose a new formulation where the adversary's knowledge is the multiset of distances to the set of attacker nodes. The goal of this article is to study the $(k,\ell)$-multiset anonymity from a graph theoretical point of view, while establishing its relationship to $(k,\ell)$-anonymity in one hand, and considering the $k$-multiset antiresolving sets as its theoretical frame, in a second one. That is, we prove properties of some graph families in relation to whether they contain a set of attacker nodes that breaks the $(k,\ell)$-multiset anonymity. From a practical point of view, we develop a linear programming formulation of the $k$-multiset antiresolving sets that allows us to calculate the resistance of social graphs against active attacks. This is useful for analysts who wish to know the level of privacy offered by a graph.

  • Open Access

    Double domination in rooted product graphs

    by Abel Cabrera-Martínez, Alejandro Estrada-Moreno


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

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

    In this paper, we show that the Italian domination number of every lexicographic product graph G ○ H can be expressed in terms of five different domination parameters of G. These parameters can be defined under the following unified approach, which encompasses the definition of several well-known domination parameters and introduces new ones. Let N(v) denote the open neighbourhood of v ∈ V(G), and let w = (w0, w1, …, wl) be a vector of nonnegative integers such that w0 ≥ 1. We say that a function f: V(G) → {0, 1, …, l} is a w-dominating function if f(N(v)) = ∑u ∈ N(v)f(u) ≥ wi for every vertex v with f(v) = i. The weight of f is defined to be ω(f) = ∑v ∈ V(G)f(v). The w-domination number of G, denoted by γw(G), is the minimum weight among all w-dominating functions on G. Specifically, we show that γI(G ○ H) = γw(G), where w ∈ {2} × {0, 1, 2}l and l ∈ {2, 3}. The decision on whether the equality holds for specific values of w0, …, wl will depend on the value of the domination number of H. This paper also provides preliminary results on γw(G) and raises the challenge of conducting a detailed study of the topic.


  • Open Access

    The k-Metric Dimension of a Unicyclic Graph

    by Alejandro Estrada-Moreno

    Given a connected graph G=(V(G),E(G)), a set S⊆V(G) is said to be a k-metric generator for G if any pair of different vertices in V(G) is distinguished by at least k elements of S. A metric generator of minimum cardinality among all k-metric generators is called a k-metric basis and its cardinality is the k-metric dimension of G. We initially present a linear programming problem that describes the problem of finding the k-metric dimension and a k-metric basis of a graph G. Then we conducted a study on the k-metric dimension of a unicyclic graph.


  • Open Access

    From the Quasi-Total Strong Differential to Quasi-Total Italian Domination in Graphs

    by Abel Cabrera Martínez, Alejandro Estrada-Moreno, Juan Alberto Rodríguez-Velázquez

    This paper is devoted to the study of the quasi-total strong differential of a graph, and it is a contribution to the Special Issue “Theoretical computer science and discrete mathematics” of Symmetry. Given a vertex x∈V(G) of a graph G, the neighbourhood of x is denoted by N(x). The neighbourhood of a set X⊆V(G) is defined to be N(X)=⋃x∈XN(x), while the external neighbourhood of X is defined to be Ne(X)=N(X)∖X. Now, for every set X⊆V(G) and every vertex x∈X, the external private neighbourhood of x with respect to X is defined as the set Pe(x,X)={y∈V(G)∖X:N(y)∩X={x}}. Let Xw={x∈X:Pe(x,X)≠⌀}. The strong differential of X is defined to be ∂s(X)=|Ne(X)|−|Xw|, while the quasi-total strong differential of G is defined to be ∂s*(G)=max{∂s(X):X⊆V(G)andXw⊆N(X)}. We show that the quasi-total strong differential is closely related to several graph parameters, including the domination number, the total domination number, the 2-domination number, the vertex cover number, the semitotal domination number, the strong differential, and the quasi-total Italian domination number. As a consequence of the study, we show that the problem of finding the quasi-total strong differential of a graph is NP-hard.


  • Open Access

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

    by 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$. These parameters can be defined under the following unified approach, which encompasses the definition of several well-known domination parameters and introduces new ones. Let $N(v)$ denote the open neighbourhood of $v\in V(G)$, and let $w=(w_0,w_1, \dots,w_l)$ be a vector of nonnegative integers such that $ w_0\ge 1$. We say that a function $f: V(G)\longrightarrow \{0,1,\dots ,l\}$ is a $w$-dominating function if $f(N(v))=\sum_{u\in N(v)}f(u)\ge w_i$ for every vertex $v$ with $f(v)=i$. The weight of $f$ is defined to be $\omega(f)=\sum_{v\in V(G)} f(v)$. The $w$-domination number of $G$, denoted by $\gamma_{w}(G)$, is the minimum weight among all $w$-dominating functions on $G$. If we impose restrictions on the minimum degree of $G$ when needed, under this approach we can define, for instance, the domination number, the total domination number, the $k$-domination number, the $k$-tuple domination number, the $k$-tuple total domination number, the Italian domination number, the total Italian domination number, and the $\{k\}$-domination number. Specifically, we show that $\gamma_{I}(G\circ H)=\gamma_{w}(G)$, where $w\in \{2\}\times\{0,1,2\}^{l}$ and $l\in \{2,3\}$. The decision on whether the equality holds for specific values of $w_0,\dots,w_l$ will depend on the value of the domination number of $H$. This paper also provides preliminary results on $\gamma_{w}(G)$ and raises the challenge of conducting a detailed study of the topic.

  • On the use of Simheuristics to Optimize Safety-Stock Levels in Material Requirements Planning with Random Demands

    by Barry B. Barrios, Angel A. Juan, Javier Panadero, Klaus Altendorfer, Andreas J. Peirleitner, Alejandro Estrada-Moreno

    Material requirements planning (MRP) integrates the planning of production, scheduling, and inventory activities in a manufacturing process. Many approaches to MRP management focus either on the simulation of the system (without considering optimization aspects) or in its optimization (without considering stochastic aspects). This paper analyzes a MRP version in which the demand of final products in each period is a random variable. The goal is then to find the optimal safety-stock configuration of both the product and the parts, i.e.: the configuration that minimizes the expected total cost. This total cost is given by: (i) the inventory cost; and (ii) a penalty cost generated by the occurrence of stock outs. To solve this stochastic optimization problem, a spreadsheet simulation model is proposed and a heuristic procedure is employed over it. A numerical example illustrates the main concepts of the proposed approach as well as its potential.


  • Open Access

    Secure w-Domination in Graphs

    by Abel Cabrera Martínez, Alejandro Estrada-Moreno, Juan A. Rodríguez-Velázquez

    This paper introduces a general approach to the idea of protection of graphs, which encompasses the known variants of secure domination and introduces new ones. Specifically, we introduce the study of secure w-domination in graphs, where w=(w0,w1,…,wl) is a vector of nonnegative integers such that w0≥1. The secure w-domination number is defined as follows. Let G be a graph and N(v) the open neighborhood of v∈V(G). We say that a function f:V(G)⟶{0,1,…,l} is a w-dominating function if f(N(v))=∑u∈N(v)f(u)≥wi for every vertex v with f(v)=i. The weight of f is defined to be ω(f)=∑v∈V(G)f(v). Given a w-dominating function f and any pair of adjacent vertices v,u∈V(G) with f(v)=0 and f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) for every x∈V(G)\{u,v}. We say that a w-dominating function f is a secure w-dominating function if for every v with f(v)=0, there exists u∈N(v) such that f(u)>0 and fu→v is a w-dominating function as well. The secure w-domination number of G, denoted by γws(G), is the minimum weight among all secure w-dominating functions. This paper provides fundamental results on γws(G) and raises the challenge of conducting a detailed study of the topic.


  • A biased-randomized algorithm for optimizing efficiency in parametric earthquake (Re) insurance solutions

    by Christopher Bayliss, Roberto Guidotti, Alejandro Estrada-Moreno, Guillermo Franco, Angel A. Juan