MathCastle
Graph TheorySuperchallengeWalks, Paths and Connectivity

Walks, Paths and Connectivity · Superchallenge problem

Let GG have vertices 0,…,80,\ldots,8, with each ii joined to i±1i\pm1 and i±2(mod9)i\pm2 \pmod 9 (so each vertex has 44 neighbors). Find κ(G)\kappa(G).