Majority out-dominating sets in digraphs

TL;DR

This paper introduces the concept of majority out-dominating sets in directed graphs, extending the set-based majority domination concept from undirected graphs and analyzing their properties.

Contribution

It defines the set majority out-domination number for digraphs and characterizes minimal majority out-dominating sets, expanding the theoretical framework of domination in digraphs.

Findings

Defined the set majority out-domination number for digraphs

Characterized minimal majority out-dominating sets

Extended the concept of majority domination to directed graphs

Abstract

The concept of majority domination in graphs has been defined in at least two different ways: As a function and as a set. In this work we extend the latter concept to digraphs, while the former was extended in another paper. Given a digraph $D=(V,A),$ a set $S\subseteq V$ is a \textit{majority out-dominating set} (MODS) of $D$ if $|N^+[S]|\geq \frac {n}{2}.$ The minimum cardinality of a MODS in $D$ is the {\it set majority out-domination number} $\gamma^+_{m}(D)$ of $D.$ In this work we introduce these concepts and prove some results about them, among which the characterization of minimal MODSs.