Author

A. Cabrera-Martínez

3 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access 2026

Double domination in some graph operators

Let G be a nontrivial graph. A set D ⊆ V(G) is a double dominating set of G if | \mathrm{N_G} [v] ∩ D| ≥ 2 for every vertex v ∈ V(G), where \mathrm{N_G} [v] represents the closed neighborhood of v. The double domination number of G is the minimum cardinality among all double dominating sets of G. In this paper we...

A. Cabrera-Martínez, Ismael Rios-Villamar, J. Sigarreta · Filomat · 1 citation

Preprint Sep 2026

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

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$. If, in addition, $D$ is an independent set, then $D$ is called an independent semitotal dominating set of $G$. The (independent) semitotal do...

A. Cabrera-Martínez, J. L. López-Carmona, Ismael Rios-Villamar et al. · 0 citations

Preprint Sep 2026

Independent domination in central graphs

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 I$ is adjacent to at least one vertex in $I$. The independent domination number of $G$ is the minimum cardinality among all independent dom...

A. Cabrera-Martínez, J. L. López-Carmona, Ismael Rios-Villamar et al. · 1 citation