473 citations · 514 across the 23 of their papers we have counts for
25 papers
Independent Locating-Dominating Sets in Pseudotrees
José Cáceres, Ignacio M. Pelayo
An ILD-set in a connected graph is a subset of vertices such that it is both independent and locating-dominating. The independent locating-dominating number of a graph G is the…
Not every graph can be reconstructed from its boundary distance matrix
José Cáceres, Ignacio M. Pelayo
A vertex of a connected graph is said to be a boundary vertex of if for some other vertex of , no neighbor of is further away from than . The boundary…
Reconstructing a graph from the distance matrix of its boundary
José Cáceres, Ignacio M. Pelayo
A vertex of a connected graph is said to be a boundary vertex of if for some other vertex of , no neighbor of is further away from than . The boundary…
Metric Location in Pseudotrees: A survey and new results
José Cáceres, Ignacio M. Pelayo
The aim of this paper is to revise the literature on different metric locations in the families of paths, cycles, trees and unicyclic graphs, as well as, provide several new result…
Metric dimension on sparse graphs and its applications to zero forcing sets
Nicolas Bousquet, Quentin Deschamps, Aline Parreau +1
The metric dimension dim(G) of a graph is the minimum cardinality of a subset of vertices of such that each vertex of is uniquely determined by its distances to …
Some Families of Graphs with Small Power Domination Number
Najibeh Shahbaznejad, Adel P Kazemi, Ignacio M Pelayo
Let be a graph with the vertex set and be a subset of . Let be the set of vertices built from , by iteratively applying the following propag…