Ismael Rios-Villamar

collaborators

2 papers

math.CO2026

On the (independent) semitotal domination in subdivision, middle, and central graphs

Abel Cabrera-Martínez, José Luis López-Carmona, Ismael Rios-Villamar +1

A dominating set $D$ of a nontrivial connected graph $G$ is called a semitotal dominating set of $G$ if every vertex in $D$ is at distance at most two from another vertex in $D$ . I…

math.CO2026

Independent domination in central graphs

Abel Cabrera-Martínez, José Luis López-Carmona, Ismael Rios-Villamar +1

Let $G$ be a graph with vertex set $V (G)$ . A set $I \subseteq V (G)$ is an independent dominating set of $G$ if no two vertices in $I$ are adjacent and every vertex in $V(G)\setminus…