Erfang Shan

activity

20112021

most citedCharacterizations of the position value for hypergraph communication situations

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

collaborators

Showing 2015Show all

2 papers · 1 filter

math.CO2015

Matching criticality in intersecting hypergraphs

Liying Kang, Zhenyu Ni, Erfang Shan

A matching in a hypergraph $H$ is a set of pairwise vertex disjoint edges in $H$ and the matching number of $H$ is the maximum cardinality of a matching in $H$ . A transversal in $H…

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…