J. Valenzuela-Tripodoro

activity

20212026

most citedTotal Roman {2}-Dominating functions in Graphs

20 citations · 46 across the 11 of their papers we have counts for

collaborators

Showing math.COShow all

9 papers · 1 filter

math.CO2026

Total outer-independent coalition in graphs

Olga Buntina, Hamidreza Golmohammadi, J. C. Valenzuela-Tripodoro

A set $D$ of vertices graph $G$ is a total outer-independent dominating set (TOIDS) of $G$ if every vertex of $G$ is adjacent to at least one vertex in $D$ , and $V (G) ∖ D$ i…

math.CO2026

Locating-dominating coalitions in graphs

M. Chellali, A. A. Dobrynin, F. Foucaud +2

A set $D$ of vertices in a graph $G = (V, E)$ is a locating-dominating set (LD-set) if it is dominating and every two vertices $u$ , $v$ of $V ∖ D$ satisfy $N(u) \cap D \neq…

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…

math.CO2024

The $k$ -distance mutual-visibility problem in graphs

M. Cera, P. Garcia-Vazquez, J. C. Valenzuela-Tripodoro +1

The concept of mutual visibility in graphs, introduced recently, addresses a fundamental problem in Graph Theory concerning the identification of the largest set of vertices in a g…

math.CO2024★ 20 cited

Total Roman {2}-Dominating functions in Graphs

H. Abdollahzadeh Ahangar, M. Chellali, S. M. Sheikholeslami +1

A Roman ${2}$ -dominating function (R2F) is a function $f : V \to {0, 1, 2}$ with the property that for every vertex $v \in V$ with $f (v) = 0$ there is a neighbor $u$ of $v$ wit…

math.CO2024★ 4 cited

On the outer independent total double Roman dominating functions

H. Abdolahzadeh Ahangar, M. Chellali, S. M. Sheikholeslami +1

Let ${0, 1, \dots, t}$ be abbreviated by $[t] .$ A double Roman dominating function (DRDF) on a graph $Γ = (V, E)$ is a map $l : V \to [3]$ satisfying \textrm{(i)} if $l (r) = 0$ the…

math.CO2024★ 17 cited

Maximal double Roman domination in graphs

H. Abdollahzadeh Ahangar, M. Chellali, S. M. Sheikholeslami +1

A maximal double Roman dominating function (MDRDF) on a graph $G = (V, E)$ is a function $f : V (G) \to {0, 1, 2, 3}$ such that \textrm{(i) }every vertex $v$ with $f (v) = 0$ is adjac…

math.CO2021★ 5 cited

Restrained condition on double Roman dominating functions

Babak Samadi, Nasrin Soltankhah, H. Abdollahzadeh Ahangar +4

We continue the study of restrained double Roman domination in graphs. For a graph $G=\big{(}V(G),E(G)\big{)}$, a double Roman dominating function $f$ is called a restrained double…