22 citations · 40 across the 13 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.CO2021
Sufficient conditions for 2-dimensional global rigidity
Xiaofeng Gu, Wei Meng, Martin Rolek +2
The 2-dimensional global rigidity has been shown to be equivalent to 3-connectedness and redundant rigidity by a combination of two results due to Jackson and Jordán, and Connelly,…
math.CO2021
Graph toughness from Laplacian eigenvalues
Xiaofeng Gu, Willem H. Haemers
The toughness of a graph is defined as , in which the minimum is taken over all such that is disconnected, wher…
math.CO2021
A tight lower bound on the matching number of graphs via Laplacian eigenvalues
Xiaofeng Gu, Muhuo Liu
Let and denote the matching number of a non-empty simple graph with vertices and the -th smallest eigenvalue of its Laplacian matrix, respectively. In this pa…