Foster graph

vertex count | 90 edge count | 135 connected component count | 1

arc-transitive | bicolorable | biconnected | bicubic | bipartite | bridgeless | class 1 | conformally rigid | connected | cubic | cyclic | distance-regular | distance-transitive | edge-transitive | flexible | fully reconstructible in C^1 | geometric | Hamilton-decomposable | Hamiltonian | Hamilton-laceable | H-star connected | LCF | local | multigraphic | nonempty | noneulerian | nonplanar | not uniquely embeddable | perfect | perfect matching | regular | simple | square-free | switchable | symmetric | traceable | triangle-free | uniquely colorable | unit-distance | vertex-transitive | weakly perfect | weakly regular

(not a named graph)

(not a named graph)

vertex degrees | 3 (90 vertices)

radius | 8 diameter | 8 girth | 10 vertex connectivity | 3 edge connectivity | 3

(x - 3) (x - 2)^9 (x - 1)^18 x^10 (x + 1)^18 (x + 2)^9 (x + 3) (x^2 - 6)^12