44 citations · 163 across the 48 of their papers we have counts for
7 papers · 1 filter
Improvements on some partial trace inequalities for positive semidefinite block matrices
Yongtao Li
We study matrix inequalities involving partial traces for positive semidefinite block matrices. First of all, we present a new method to prove a celebrated result of Choi [Linear A…
A survey on spectral conditions for some extremal graph problems
Yongtao Li, Weijun Liu, Lihua Feng
This survey is two-fold. We first report new progress on the spectral extremal results on the Turán type problems in graph theory. More precisely, we shall summarize the spectral T…
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…
An Oppenheim type inequality for positive definite block matrices
Yongtao Li, Yuejian Peng
We present an Oppenheim type determinantal inequality for positive definite block matrices. Recently, Lin [Linear Algebra Appl. 452 (2014) 1--6] proved a remarkable extension of Op…
Spectral extremal graphs for intersecting cliques
Dheer Noal Desai, Liying Kang, Yongtao Li +3
The -fan is the graph consisting of copies of the complete graph which intersect in a single vertex, and is denoted by . Erdős, Füredi, Gould and Gunderso…
Sufficient spectral conditions for graphs being -edge-Hamiltonian or -Hamiltonian
Yongtao Li, Yuejian Peng
A graph is -edge-Hamiltonian if any collection of vertex-disjoint paths with at most edges altogether belong to a Hamiltonian cycle in . A graph is -Hamiltonia…