activity
20192022
most citedSome applications of two completely copositive maps

2 citations · 3 across the 7 of their papers we have counts for

collaborators

7 papers

math.CO2022

Spectral radius and the -power of Hamilton cycles

Xinru Yan, Xiaocong He, Lihua Feng +1

Let be a graph of order and spectral radius be the largest eigenvalue of its adjacency matrix, denoted by . In this paper, we determine the unique graph with maximum…

math.CO2021

The Q-index and connectivity of graphs

Peng-Li Zhang, Lihua Feng, Weijun Liu +1

A connected graph is said to be -connected if it has more than vertices and remains connected whenever fewer than vertices are deleted. In this paper, for a connecte…

math.CO20211 cited

A tight -index condition for a graph to be -path-coverable involving minimum degree

Tao Cheng, Lihua Feng, Yongtao Li +1

A graph is -path-coverable if its vertex set can be covered by or fewer vertex disjoint paths. In this paper, using the -index of a connected graph , we pre…

math.RA2020

Extensions of Fiedler-Markham's inequality and Thompson's inequality

Yongtao Li, Yang Huang, Lihua Feng +1

We present some new inequalities related to determinant and trace for positive semidefinite block matrices by using symmetric tensor product, which are extensions of Fiedler-Markha…

math.FA2020

Another determinantal inequality involving partial traces

Yongtao Li, Lihua Feng, Weijun Liu +1

Let be a positive semidefinite block matrix with each block -square, then the following determinantal inequality for partial traces holds \[ (\mathrm{tr} A)^{mn}…

math.FA20202 cited

Some applications of two completely copositive maps

Yongtao Li, Yang Huang, Lihua Feng +1

A linear map is called completely copositive if the resulting matrix is positive semidefinite for any integer and pos…