👉 In mathematical terms, a property of a graph that indicates whether it is "sub-Rigidity" or not. A graph is said to be sub-Rigidity if its maximum degree (the largest number of edges in any spanning tree) is less than twice the minimum degree (the smallest number of edges in any spanning tree).
