20 citations · 36 across the 15 of their papers we have counts for
16 papers
On spectral Turán theorems: confirming a conjecture of Guiduli and two problems of Nikiforov
Lele Liu, Bo Ning
Let be an -vertex graph, and let and denote the largest and smallest eigenvalues of its adjacency matrix. Write for the number of edges of , $d(G)=…
Spectral Turán-type problems on sparse spanning graphs
Lele Liu, Bo Ning
Let be a graph and $\SPEX (n, F)$ be the class of -vertex graphs which attain the maximum spectral radius and contain no as a subgraph. Let $\EX (n, F)$ be the family of…
Unsolved Problems in Spectral Graph Theory
Lele Liu, Bo Ning
Spectral graph theory is a captivating area of graph theory that employs the eigenvalues and eigenvectors of matrices associated with graphs to study them. In this paper, we presen…
Spectral Turán Type Problems on Cancellative Hypergraphs
Zhenyu Ni, Lele Liu, Liying Kang
Let be a cancellative -uniform hypergraph in which the symmetric difference of any two edges is not contained in a third one. Equivalently, a -uniform hypergraph is c…
Two conjectures in spectral graph theory involving the linear combinations of graph eigenvalues
Lele Liu
We prove two conjectures in spectral extremal graph theory involving the linear combinations of graph eigenvalues. Let be the largest eigenvalue of the adjacency matrix of…
Maximum principal ratio of the signless Laplacian of graphs
Lele Liu, Shengming Hu, Changxiang He
Let be a connected graph and be the signless Laplacian of . The principal ratio of is the ratio of the maximum and minimum entries of the Perron vector…