I. Pelayo

activity

20242026

collaborators

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 $S$ of vertices such that it is both independent and locating-dominating. The independent locating-dominating number of a graph G is the…

math.CO2025

Not every graph can be reconstructed from its boundary distance matrix

A vertex $v$ of a connected graph $G$ is said to be a boundary vertex of $G$ if for some other vertex $u$ of $G$ , no neighbor of $v$ is further away from $u$ than $v$ . The boundary…

math.CO2024

Reconstructing a graph from the distance matrix of its boundary

A vertex $v$ of a connected graph $G$ is said to be a boundary vertex of $G$ if for some other vertex $u$ of $G$ , no neighbor of $v$ is further away from $u$ than $v$ . The boundary…