Valeria Leoni

collaborators

3 papers

math.CO2026

On ${2}$ -Roman graph recognition of Partner Limited graphs

Lara Fernández, Valeria Leoni

Given a graph $G = (V, E)$ , $f : V \to {0, 1, 2}$ is a \emph{Roman ${2}$ -dominating function} of $G$ if for every vertex $v \in V$ with $f (v) = 0$ , either there exists a ver…

math.CO2026

Roman ${2}$ -domination on Graphs with "few" 4-paths

Lara FernÃ¡ndez, Valeria Leoni

Given a graph $G$ with vertex set $V$ , $f : V \to {0, 1, 2}$ is a \emph{Roman ${2}$ -dominating function} (or \emph{italian dominating function}) of $G$ if for every ver…

math.CO2026

On ${k}$ -Roman graphs: complexity of recognition and the case of split graphs

Kenny BeÅ¡ter Å torgel, Kenny Bešter Štorgel, Nina Chiarelli +7

For a positive integer $k$ , a ${k}$ -Roman dominating function of a graph $G = (V, E)$ is a function $f : V \to {0, 1, \dots, k}$ satisfying $\sum_{u\in N(v)} f(u) \geq…

On {2}-Roman graph recognition of Partner Limited graphs

Roman {2}-domination on Graphs with "few" 4-paths

On {k}-Roman graphs: complexity of recognition and the case of split graphs

On ${2}$ -Roman graph recognition of Partner Limited graphs

Roman ${2}$ -domination on Graphs with "few" 4-paths

On ${k}$ -Roman graphs: complexity of recognition and the case of split graphs