5 citations · 10 across the 7 of their papers we have counts for
1 paper · 1 filter
Armen S. Asratian, Jonas B. Granholm
Let G(k) denote the set of connected k-regular graphs G, k≥2, where the number of vertices at distance 2 from any vertex in G does not exceed k. Asratian (…