Yanxia Dong

activity

20152017

most citedDomination in intersecting hypergraphs

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2017★ 1 cited

Domination in intersecting hypergraphs

Yanxia Dong, Erfang Shan, Shan Li +1

A matching in a hypergraph $H$ is a set of pairwise disjoint hyperedges. The matching number $α^{'} (H)$ of $H$ is the size of a maximum matching in $H$ . A subset $D$ of vertices of $H…

math.CO2016

Extremal hypergraphs for matching number and domination number

Erfang Shan, Yanxia Dong, Liying Kang +1

A matching in a hypergraph $H$ is a set of pairwise disjoint hyperedges. The matching number $ν (H)$ of $H$ is the size of a maximum matching in $\math…

math.CO2015

The distance domination of generalized de Bruijn and Kautz digraphs

Yanxia Dong, Erfang Shan, Xiao Min

Let $G = (V, A)$ be a digraph and $k \geq 1$ an integer. For $u, v \in V$ , we say that the vertex $u$ distance $k$ -dominate $v$ if the distance from $u$ to $v$ at most $k$ . A set $D$ of v…