1 citations · 1 across the 3 of their papers we have counts for
7 papers
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 edges and given siz…
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…
On the irregularity of uniform hypergraphs
Lele Liu, Liying Kang, Erfang Shan
Let be an -uniform hypergraph on vertices and edges, and let be the degree of . Denote by the difference of the spectral radius of…
Total domination polynomials of graphs
Jiuhua Hu, Erfang Shan, Shaohui Wang +2
Given a graph , a total dominating set is a vertex set that every vertex of is adjacent to some vertices of and let be the number of all total dominat…
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…
The distance domination of generalized de Bruijn and Kautz digraphs
Yanxia Dong, Erfang Shan, Xiao Min
Let be a digraph and an integer. For , we say that the vertex distance -dominate if the distance from to at most . A set of v…