1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.CO2023
On a relationship between the characteristic and matching polynomials of a uniform hypertree
Honghai Li, Li Su, Shaun Fallat
A hypertree is a connected hypergraph without cycles. Further a hypertree is called an -tree if, additionally, it is -uniform. Note that 2-trees are just ordinary trees. A cl…
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 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…