O. Favaron

collaborators

2 papers

math.CO2022

Partial Domination and Irredundance Numbers in Graphs

Pawaton Kaemawichanurat, Odile Favaron

A dominating set of a graph $G = (V, E)$ is a vertex set $D$ such that every vertex in $V (G) ∖ D$ is adjacent to a vertex in $D$ . The cardinality of a smallest dominating set…

math.CO2020

Inequalities between Partial Domination and Independent Partial Domination in Graphs

Odile Favaron, Pawaton Kaemawichanurat

For a graph $G$ , a vertex subset $S \subseteq V (G)$ is said to be $K_{k}$ -isolating if $G - N_{G} [S]$ does not contain $K_{k}$ as a subgraph. The $K_{k}$ -isolation number of $G$ , d…