7 citations · 33 across the 43 of their papers we have counts for
6 papers · 1 filter
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…
The minimum Q-index of strongly connected bipartite digraphs with complete bipartite subdigraphs
Weige Xi, Ligong Wang
Let denote the set of strongly connected bipartite digraphs on vertices which contain a complete bipartite subdigraph , wher…
Ordering of bicyclic graphs by matching energy
Xiangxiang Liu, Ligong Wang, Peng Xiao
Let be a simple graph of order and be the roots of its matching polynomial. The matching energy is defined as the sum , wh…
Edge Connectivity, Packing Spanning Trees, and Eigenvalues of Graphs
Cunxiang Duan, Ligong Wang, Xiangxiang Liu
Let be the set of simple graphs (or multigraphs) such that for each there exists at least two non-empty disjoint proper subsets $V_{1},V_{2}\s…