María Gracia Cornet

collaborators

3 papers

math.CO2025

Monophonic number of Kneser graphs and strongly 2-monophonic graphs

Boštjan Brešar, María Gracia Cornet, Tanja Dravec

Given a graph $G$ a set $S \subset V (G)$ is called monophonic if every vertex in $G$ lies on some induced path between two vertices in $S$ . The monophonic number, $m (G)$ , of $G$ , wh…

math.CO2023

$k$ -Domination invariants on Kneser graphs

Boštjan Brešar, María Gracia Cornet, Tanja Dravec +1

In this follow-up to [M.G.~Cornet, P.~Torres, arXiv:2308.15603], where the $k$ -tuple domination number and the 2-packing number in Kneser graphs $K (n, r)$ were studied, we are conce…

math.CO2023

Bounds on zero forcing using (upper) total domination and minimum degree

Boštjan Brešar, María Gracia Cornet, Tanja Dravec +1

While a number of bounds are known on the zero forcing number $Z (G)$ of a graph $G$ expressed in terms of the order of a graph and maximum or minimum degree, we present two bounds…

Monophonic number of Kneser graphs and strongly 2-monophonic graphs

k-Domination invariants on Kneser graphs

Bounds on zero forcing using (upper) total domination and minimum degree

$k$ -Domination invariants on Kneser graphs