Qiannan Zhou

activity

20162026

most citedQuantitative Versions of the Two-dimensional Gaussian Product Inequalities

3 citations · 5 across the 8 of their papers we have counts for

collaborators

Showing math.COShow all

9 papers · 1 filter

math.CO2026

Triangle-free Rank--Ramsey graphs from ordered incidence lifts

Yong Lu, Qi Wu, Qiannan Zhou

For a graph $G$ with adjacency matrix $A_{G}$ and a coefficient field $K$ , put $ρ_{K} (G) = rank_{K} (A_{G} + I)$ . We answer the triangle-free Rank--Ra…

math.CO2026

Hamiltonian cycles in 7-tough $(P_{4} \cup P_{1})$ -free graphs

Yong Lu, Qi Wu, Qiannan Zhou

Shan~[J. Graph Theory (2026)] proved that every 23-tough $(P_{4} \cup P_{1})$ -free graph on at least three vertices is Hamiltonian. We improve this bound to 7 by replacing the final cut…

math.CO2025

Distance signless Laplacian spectral radius and tough graphs involving minimun degree

Xiangge Liu, Yong Lu, Caili Jia +2

Let $G = (V (G), E (G))$ be a simple graph, where $V (G)$ and $E (G)$ are the vertex set and the edge set of $G$ , respectively. The number of components of $G$ is denoted by $c (G)$ . Let $…

math.CO2017

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.

math.CO2017★ 1 cited

The rank of a complex unit gain graph in terms of the rank of its underlying graph

Yong Lu, Ligong Wang, Qiannan Zhou

Let $Φ = (G, φ)$ be a complex unit gain graph (or $T$ -gain graph) and $A (Φ)$ be its adjacency matrix, where $G$ is called the underlying graph of $Φ$ . The rank of $Φ$ , denot…

math.CO2017

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…

math.CO2016★ 1 cited

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 $G^{σ}$ be an oriented graph and $S (G^{σ})$ be its skew-adjacency matrix, where $G$ is called the underlying graph of $G^{σ}$ . The skew-rank of $G^{σ}$ , denoted by $sr (G^{σ})$ , is the ra…

math.CO2016

Hermitian-Randić matrix and Hermitian-Randić energy of mixed graphs

Yong Lu, Ligong Wang, Qiannan Zhou

Let $M$ be a mixed graph and $H (M)$ be its Hermitian-adjacency matrix. If we add every edge and arc in $M$ a Randić weight, then we can get a new weighted Hermitian-adjacency matri…

math.CO2016

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…

Triangle-free Rank--Ramsey graphs from ordered incidence lifts

Hamiltonian cycles in 7-tough (P4​∪P1​)-free graphs

Distance signless Laplacian spectral radius and tough graphs involving minimun degree

Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree

The rank of a complex unit gain graph in terms of the rank of its underlying graph

Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius

Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph

Hermitian-Randić matrix and Hermitian-Randić energy of mixed graphs

Distance signless Laplacian spectral radius and Hamiltonian properties of graphs

Hamiltonian cycles in 7-tough $(P_{4} \cup P_{1})$ -free graphs