J. Valenzuela-Tripodoro

collaborators

3 papers

cs.DM2025

Roman domination in weighted graphs

Martín Cera, Pedro García-Vázquez, Juan Carlos Valenzuela-Tripodoro

A Roman dominating function for a (non-weighted) graph $G = (V, E)$ , is a function $f : V \to {0, 1, 2}$ such that every vertex $u \in V$ with $f (u) = 0$ has at least {one} neighbor…

math.CO2025

Total restrained coalitions in graphs

M. Chellali, J. C. Valenzuela-Tripodoro, H. Golmohammadi +2

A set $S \subseteq V$ in an isolate-free graph $G$ is a total restrained dominating set, abbreviated TRD-set, if every vertex in $V$ is adjacent to a vertex in $S$ , and every vertex…

math.CO2025

p-Strong Roman Domination in Graphs

J. C. Valenzuela-Tripodoro, M. A. Mateos-Camacho, M. Cera +2

Domination in graphs is a widely studied field, where many different definitions have been introduced in the last years to respond to different network requirements. This paper pre…