3 citations · 5 across the 8 of their papers we have counts for
10 papers
Triangle-free Rank--Ramsey graphs from ordered incidence lifts
Yong Lu, Qi Wu, Qiannan Zhou
For a graph with adjacency matrix and a coefficient field , put . We answer the triangle-free Rank--Ra…
Hamiltonian cycles in 7-tough -free graphs
Yong Lu, Qi Wu, Qiannan Zhou
Shan~[J. Graph Theory (2026)] proved that every 23-tough -free graph on at least three vertices is Hamiltonian. We improve this bound to 7 by replacing the final cut…
Distance signless Laplacian spectral radius and tough graphs involving minimun degree
Xiangge Liu, Yong Lu, Caili Jia +2
Let be a simple graph, where and are the vertex set and the edge set of , respectively. The number of components of is denoted by . Let $…
Quantitative Versions of the Two-dimensional Gaussian Product Inequalities
Ze-Chun Hu, Han Zhao, Qian-Qian Zhou
The Gaussian product inequality (GPI) conjecture is one of the most famous inequalities associated with Gaussian distributions and has attracted a lot of concerns. In this note, we…
Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree
Qiannan Zhou, Ligong Wang, Yong Lu
In this paper, we present a spectral sufficient condition for a graph to be Hamilton-connected in terms of signless Laplacian spectral radius with large minimum degree.
The rank of a complex unit gain graph in terms of the rank of its underlying graph
Yong Lu, Ligong Wang, Qiannan Zhou
Let be a complex unit gain graph (or -gain graph) and be its adjacency matrix, where is called the underlying graph of . The rank of , denot…
Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius
Qiannan Zhou, Ligong Wang, Yong Lu
In this paper, we present some spectral sufficient conditions for a graph to be Hamilton-connected in terms of the spectral radius or signless Laplacian spectral radius of the grap…
Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph
Yong Lu, Ligong Wang, Qiannan Zhou
Let be an oriented graph and be its skew-adjacency matrix, where is called the underlying graph of . The skew-rank of , denoted by , is the ra…
Hermitian-Randić matrix and Hermitian-Randić energy of mixed graphs
Yong Lu, Ligong Wang, Qiannan Zhou
Let be a mixed graph and be its Hermitian-adjacency matrix. If we add every edge and arc in a Randić weight, then we can get a new weighted Hermitian-adjacency matri…
Distance signless Laplacian spectral radius and Hamiltonian properties of graphs
Qiannan Zhou, Ligong Wang
In this paper, first, we establish a sufficient condition for a bipartite graph to be Hamilton-connected. Furthermore, we also give two sufficient conditions on distance signless L…