Alejandro Estrada-Moreno

Dr. Alejandro Estrada-Moreno

Universitat Rovira i Virgili (Spain)
orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2016 in Discrete Mathematics
Verified
Journal Article
Closed access
AEAlejandro Estrada-Moreno
Alejandro Estrada-Moreno
Ismael Gonzalez YeroIsmael Gonzalez Yero
Ismael Gonzalez Yero
Juan Rodríguez VelázquezJuan Rodríguez Velázquez
Juan Rodríguez Velázquez

20 January 2019 in International Transactions in Operational Research
Verified
Journal Article
Closed access
PDF file
AEAlejandro Estrada-Moreno
Alejandro Estrada-Moreno
MSM. Savelsbergh
M. Savelsbergh
Angel A. JuanAngel A. Juan
Angel A. Juan
Javier PanaderoJavier Panadero
Javier Panadero

14 December 2015 in Bulletin of the Malaysian Mathematical Sciences Society
Verified
Journal Article
Closed access
PDF file
AEAlejandro Estrada-Moreno
Alejandro Estrada-Moreno
Ismael Gonzalez YeroIsmael Gonzalez Yero
Ismael Gonzalez Yero
Juan Rodríguez VelázquezJuan Rodríguez Velázquez
Juan Rodríguez Velázquez

1 May 2017 in Applied Mathematics and Computation
Verified
Journal Article
Closed access
Ismael Gonzalez YeroIsmael Gonzalez Yero
Ismael Gonzalez Yero
AEAlejandro Estrada-Moreno
Alejandro Estrada-Moreno
Juan Rodríguez VelázquezJuan Rodríguez Velázquez
Juan Rodríguez Velázquez

8 April 2020 in The Computer Journal
Verified
Journal Article
Closed access
AEAlejandro Estrada-Moreno
Alejandro Estrada-Moreno
IYI G Yero
I G Yero
JRJ A Rodríguez-Velázquez
J A Rodríguez-Velázquez
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$ points $w_1,w_2, \ldots w_k\in S$ such that $d(u,w_i)\ne d(v,w_i),\; \textrm{for all}\; i\in \{1, \ldots k\}.$ Let $\mathcal{R}_k(X)$ be the set of metric generators for $X$. The $k$-metric dimension $\dim _k(X)$ of $(X,d)$ is defined as $$\begin{equation*}\dim_k(X)=\inf\{|S|:\, S\in \mathcal{R}_k(X)\}.\end{equation*}$$Here, we discuss the $k$-metric dimension of $(V,d_t)$, where $V$ is the set of vertices of a simple graph $G$ and the metric $d_t:V\times V\rightarrow \mathbb{N}\cup \{0\}$ is defined by $d_t(x,y)=\min \{d(x,y),t\}$ from the geodesic distance $d$ in $G$ and a positive integer $t$. The case $t\ge D(G)$, where $D(G)$ denotes the diameter of $G$, corresponds to the original theory of $k$-metric dimension, and the case $t=2$ corresponds to the theory of $k$-adjacency dimension. Furthermore, this approach allows us to extend the theory of $k$-metric dimension to the general case of non-necessarily connected graphs. Finally, we analyse the computational complexity of determining the $k$-metric dimension of $(V,d_t)$ for the metric $d_t$.

1 February 2020 in Theoretical Computer Science
Verified
Journal Article
Closed access
AEAlejandro Estrada-Moreno
Alejandro Estrada-Moreno