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

14 papers

math.CO2021★ 1 cited

Anti-Ramsey number of matchings in $r$ -partite $r$ -uniform hypergraphs

Yisai Xue, Erfang Shan, Liying Kang

An edge-colored hypergraph is rainbow if all of its edges have different colors. Given two hypergraphs $H$ and $G$ , the anti-Ramsey number $ar(\mathcal{G}, \mat…

math.CO2018

The largest spectral radius of uniform hypertrees with a given size of matching

Li Su, Liying Kang, Honghai Li +1

In this paper, using the theory of matching polynomial of hypertrees and ordering of hypertrees, we determine the largest spectral radius of hypertrees with $m$ edges and given siz…

math.CO2018★ 1 cited

The matching polynomials and spectral radii of uniform supertrees

Li Su, Liying Kang, Honghai Li +1

We study matching polynomials of uniform hypergraph and spectral radii of uniform supertrees. By comparing the matching polynomials of supertrees, we extend Li and Feng's results o…

math.CO2018

On the irregularity of uniform hypergraphs

Lele Liu, Liying Kang, Erfang Shan

Let $H$ be an $r$ -uniform hypergraph on $n$ vertices and $m$ edges, and let $d_{i}$ be the degree of $i \in V (H)$ . Denote by $ε (H)$ the difference of the spectral radius of…

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.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…

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…

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…

math.CO2011

On the super connectivity of Kronecker products of graphs

Hechao Wang, Erfang Shan

In this paper we present the super connectivity of Kronecker product of a general graph and a complete graph.

Anti-Ramsey number of matchings in r-partite r-uniform hypergraphs