3 papers
math.CO2026
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…
math.CO2026
The Borsuk number of a graph
José Cáceres, Delia Garijo, Alberto Márquez +1
The Borsuk problem asks for the smallest number of subsets with strictly smaller diameters into which any bounded set in the -dimensional space can be decomposed. It is a classi…
math.CO2025
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…