Yong Lu

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

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

collaborators

3 papers

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…