Yoshiko Wakabayashi

collaborators

3 papers

math.CO2026

The complexity of minimum-density locating-dominating set in infinite periodic graphs

Arthur C. Gomes, Yoshiko Wakabayashi

A dominating set $S$ of a graph $G$ is a locating-dominating set (LDS) if, for each pair of distinct vertices not in~ $S$ , their neighbourhoods in $S$ are distinct. Finding a minimu…

math.CO2026

Optimal and quasi-optimal locating-dominating densities in the infinite hexagonal grid with a finite number of rows

Arthur C. Gomes, Yoshiko Wakabayashi

A set of vertices $S$ of a graph $G$ is locating-dominating if $S$ is dominating and, for each pair of distinct vertices not in $S$ , their neighborhoods in $S$ are distinct. We pre…

math.CO2025

Boundedness for proper conflict-free and odd colorings

The proper conflict-free chromatic number, $χ_{p c f} (G)$ , of a graph $G$ is the least $k$ such that $G$ has a proper $k$ -coloring in which for each non-isolated vertex there is a co…