Foster graph

From Wikipedia, the free encyclopedia

Foster graph

This box: view • talk • edit

In graph theory the Foster graph is a graph on 90 vertices and 135 arcs. It is the unique distance-transitive graph with intersection array {3,2,2,2,2,1,1,1;1,1,1,1,2,2,2,3}. It can be constructed as the incidence graph of the partial linear space which is the unique triple cover with no 8-gons of the generalized quadrangle GQ(2,2).