# Twin domination number of Tournaments

## TL;DR

This paper investigates the twin domination number in orientations of complete graphs, proving exact values for specific cases and providing new bounds that disprove a longstanding conjecture for all sufficiently large n.

## Contribution

The authors determine the exact twin domination number for K8 and K9, and establish new upper bounds for larger n, challenging previous conjectures.

## Key findings

- Proved DOM^{*}(K_8)=DOM^{*}(K_9)=4
- Established new upper bounds for DOM^{*}(K_n)
- Disproved the conjecture that DOM^{*}(K_n)=ceil((n+1)/2) for n ≥ 8

## Abstract

Let $D=(V,A)$ be a digraph. A subset $S$ of $V$ is called a twin dominating set of $D$ if for every vertex $v\in V-S$, there exists vertices $u_1,u_2 \in S$ such that $(v,u_1)$ and $(u_2,v)$ are arcs in $D$. The minimum cardinality of a twin dominating set in $D$ is called the twin domination number of $D$ and is denoted by $\gamma ^{*}(D)$. The upper orientable twin domination number of a graph $G$ is $DOM^{*}(G)=\max\{ \gamma ^{*}(D)|D \ \text{is an orientation of G} \}.$ It has been conjectured that for the complete graph $K_n$ with $n\geq 8$, $DOM^{*}(K_n)=\left\lceil \frac{n+1}{2}\right\rceil$. In this work we prove $DOM^{*}(K_8)= DOM^{*}(K_9)= 4$ and establish new upper bounds for $DOM^{*}(K_n)$, disproving the same above conjecture for all $n \geq 8$.