Erfang Shan

activity

20142017

most citedSharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees

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

collaborators

4 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.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.CO2014

Coloring clique-hypergraph of $K_{5}$ -minor-free graphs

Erfang Shan, Yuxiao Sun, Liying Kang

A clique-coloring of a graph $G$ is a coloring of the vertices of $G$ so that no maximal clique of size at least two is monochromatic. The clique-hypergraph, $H (G)$ , of a…

math.CO2014

3-Factor-criticality in double domination edge critical graphs

Haichao Wang, Erfang Shan, Yancai Zhao

A vertex subset $S$ of a graph $G$ is a double dominating set of $G$ if $∣ N [v] \cap S ∣ \geq 2$ for each vertex $v$ of $G$ , where $N [v]$ is the set of the vertex $v$ and vertices adja…

Domination in intersecting hypergraphs

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

Coloring clique-hypergraph of K5​-minor-free graphs

3-Factor-criticality in double domination edge critical graphs

Coloring clique-hypergraph of $K_{5}$ -minor-free graphs