Connected cubic symmetric graphs are sometimes called Foster graphs and denoted 
, where 
is the vertex count and 
is a letter A, B, C, ... indicating the particular such cubic symmetric graph in the standard Foster
census enumeration an its extensions (Foster 1932, Bouwer et al. 1988, Conder
and Dobcsányi 2002, Royle). Many Foster graphs can be constructed as honeycomb
toroidal graphs.
"The" Foster graph is the cubic symmetric graph 
on 90 vertices illustrated above that has 135 edges and is also distance-regular
with intersection array 
. It has girth 10, radius 8,
and diameter 8. The Foster graph is also Hamiltonian.
It has a unique order-15 LCF notations (![[17,-9,37,-37,9,-17]^(15)](/images/equations/FosterGraph/Inline6.svg)
), 4 order-5 notations, and 2 order-2
notations (illustrated above), as well as 397 order-1 notations.
The Foster graph is not uniquely determined by its graph spectrum (van Dam and Haemers 2003). It has graph spectrum
 |
so it is not quite an integral graph.
It has chromatic number 2.
The halved Foster graph is distance-regular with intersection array 
.
