L. Kang

activity

20142023

most citedOn the principal eigenvectors of uniform hypergraphs

20 citations · 37 across the 21 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★ 7 cited

Some results on the spectral radii of uniform hypergraphs

Liying Kang, Lele Liu, Liqun Qi +1

Let A(G) be the adjacency tensor (hypermatrix) of uniform hypergraph G. The maximum modulus of the eigenvalues of A(G) is called the spectral radius of G. In this paper, the conjec…

math.CO2016★ 20 cited

On the principal eigenvectors of uniform hypergraphs

Lele Liu, Liying Kang, Xiying Yuan

Let $A (H)$ be the adjacency tensor of $r$ -uniform hypergraph $H$ . If $H$ is connected, the unique positive eigenvector $x = (x_{1}, x_{2}, \dots, x_{n})^{T}$ with $||x||_r…