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 2016Show all

4 papers · 1 filter

math.SP2016★ 2 cited

Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees

Lele Liu, Liying Kang, Erfang Shan

Let $A (H)$ and $Q (H)$ be the adjacency tensor and signless Laplacian tensor of an $r$ -uniform hypergraph $H$ . Denote by $ρ (H)$ and $ρ (Q (H))$ the spect…

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.CO2016★ 1 cited

Total domination polynomials of graphs

Jiuhua Hu, Erfang Shan, Shaohui Wang +2

Given a graph $G$ , a total dominating set $D_{t}$ is a vertex set that every vertex of $G$ is adjacent to some vertices of $D_{t}$ and let $d_{t} (G, i)$ be the number of all total dominat…

math.OC2016★ 3 cited

Characterizations of the position value for hypergraph communication situations

Erfang Shan, Guang Zhang

The Mayser value (Myerson (1977)), the position value (Meessen (1988)) and the average tree solution (Herings et al.) are three most important allocation rules for (graph or hyperg…