3 citations · 3 across the 4 of their papers we have counts for
1 paper · 1 filter
Tony Zeng
Suppose a finite, unweighted, combinatorial graph G=(V,E) is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. G…