Xin-Hui An

collaborators

2 papers

math.CO2017

Independent transversal domination number of a graph

Hongting Wang, Baoyindureng Wu, Xinhui An

Let $G = (V, E)$ be a graph. A set $S \subseteq V (G)$ is a {\it dominating set} of $G$ if every vertex in $V ∖ S$ is adjacent to a vertex of $S$ . The {\it domination number} of…

math.CO2016

A $P_{3}$ -decomposition of tournaments and bipartite digraphs

Fangxia Wang, Baoyindureng Wu, Xinhui An

A $P_{3}$ -decomposition of a directed graph $D$ is a partition of the arcs of $D$ into directed paths of length $2$ . In this paper, we give a characterization for…

Independent transversal domination number of a graph

A P3​​-decomposition of tournaments and bipartite digraphs

A $P_{3}$ -decomposition of tournaments and bipartite digraphs