473 citations · 572 across the 27 of their papers we have counts for
24 papers · 1 filter
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)=…
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 -packing differential of a graph
A. Cabrera Martinez, M. L. Puertas, J. A. Rodriguez-Velazquez
Let be a graph of order and vertex set . Given a set , we define the external neighbourhood of as the set of all vertices in $V(G)\se…
On the Metric Dimensions for Sets of Vertices
Anni Hakanen, Ville Junnila, Tero Laihonen +1
Resolving sets were originally designed to locate vertices of a graph one at a time. For the purpose of locating multiple vertices of the graph simultaneously, -resolving…