473 citations · 572 across the 27 of their papers we have counts for
29 papers
Metric representations by minimal graphs
Víctor Franco-Sánchez, Mercè Mora, María Luz Puertas
A resolving set in a graph is a vertex subset such that each can be uniquely identified by the vector $r(u \vert W) = (d(u,…
On the metric representation of the vertices of a graph
Mercè Mora, María Luz Puertas
The metric representation of a vertex in a connected graph respect to an ordered vertex subset is the vector of distances $r(u\vert W)=…
HPC acceleration of large (min, +) matrix products to compute domination-type parameters in graphs
E. M. Garzón, J. A. Martínez, J. J. Moreno +1
The computation of the domination-type parameters is a challenging problem in Cartesian product graphs. We present an algorithmic method to compute the -domination number of the…
Powers of large matrices on GPU platforms to compute the Roman domination number of cylindrical graphs
J. A. Martínez, E. M. Garzón, M. L. Puertas
The Roman domination in a graph is a variant of the classical domination, defined by means of a so-called Roman domination function such that if $f(…
The 2-domination number of cylindrical graphs
José Antonio Martínez, Ana Belén Castaño-Fernández, María Luz Puertas
A vertex subset S of a graph G is said to 2-dominate the graph if each vertex not in S has at least two neighbors in it. As usual, the associated parameter is the minimum cardinal…
On the -domination number of cylinders with small cycles
E. M. Garzón, J. A. Martínez, J. J. Moreno +1
Domination-type parameters are difficult to manage in Cartesian product graphs and there is usually no general relationship between the parameter in both factors and in the product…