Hebert Pérez-Rosés

activity

20132018

most citedA revised Moore bound for mixed graphs

22 citations · 51 across the 8 of their papers we have counts for

collaborators

Showing 2017Show all

1 paper · 1 filter

math.CO2017

On the weak Roman domination number of lexicographic product graphs

Magdalena Valveny, Hebert Pérez-Rosés, Juan A. Rodríguez-Velázquez

A vertex $v$ of a graph $G = (V, E)$ is said to be undefended with respect to a function $f : V ⟶ {0, 1, 2}$ if $f (v) = 0$ and $f (u) = 0$ for every vertex $u$ adjacent to $v$ …