activity
20112016
most citedThe extremal spectral radii of -uniform supertrees

17 citations · 40 across the 10 of their papers we have counts for

collaborators

10 papers

math.CO2016★ 1 cited

Some properties and applications of odd-colorable -hypergraphs

Xiying Yuan, Liqun Qi, Jiayu Shao +1

Let and be even. An -hypergraph on vertices is called odd-colorable if there exists a map such that for any edge $\{j_{1},j_{2}…

math.RA2016

On some properties of three different types of triangular blocked tensors

Jiayu Shao, Lihua You

We define three types of upper (and lower) triangular blocked tensors, which are all generalizations of the triangular blocked matrices. We study some basic properties and characte…

math.CO2015

The proof of a conjecture on largest Laplacian and signless Laplacian H-eigenvalues of uniform hypergraphs

Xiying Yuan, Liqun Qi, Jiayu Shao

Let and be the adjacency tensor, Laplacian tensor and signless Laplacian tensor of uniform hypergra…

math.SP2014★ 17 cited

The extremal spectral radii of -uniform supertrees

Honghai Li, Jiayu Shao, Liqun Qi

In this paper, we study some extremal problems of three kinds of spectral radii of -uniform hypergraphs (the adjacency spectral radius, the signless Laplacian spectral radius an…

math.CO2014★ 2 cited

Some Spectral Properties and Characterizations of Connected Odd-bipartite Uniform Hypergraphs

Jia-Yu Shao, Hai-Ying Shan, Bao-feng Wu

A -uniform hypergraph is called odd-bipartite ([5]), if is even and there exists some proper subset of such that each edge of contains odd number of…

math.CO2013★ 3 cited

Regular Uniform Hypergraphs, -Cycles, -Paths and Their largest Laplacian H-Eigenvalues

Liqun Qi, Jiayu Shao, Qun Wang

In this paper, we show that the largest signless Laplacian H-eigenvalue of a connected -uniform hypergraph , where , reaches its upper bound , where is…