mathematical field of graph theory, the Foster graph is a bipartite 3-regular graph with 90 vertices and 135 edges. The Foster graph is Hamiltonian and has...

the Dyck graph, the Foster graph and the Biggs–Smith graph. The ten distance-transitive graphs listed above, together with the Foster graph and the Biggs–Smith...

field of graph theory, the Foster cage is a 5-regular undirected graph with 30 vertices and 75 edges. It is one of the four (5,5)-cage graphs, the others...

Möbius–Kantor graph, the Pappus graph, the Desargues graph, the Nauru graph, the Coxeter graph, the Tutte–Coxeter graph, the Dyck graph, the Foster graph and the...

graph Pappus graph Desargues graph Nauru graph Coxeter graph Tutte–Coxeter graph Dyck graph Klein graph Foster graph Biggs–Smith graph The Rado graph...

He is also known for the Foster census of cubic, symmetric graphs and the 90-vertex cubic symmetric Foster graph. Foster was a Harvard College graduate...

distance-transitive graph (see the Foster census) and therefore distance regular. There are 24 perfect matchings in the Heawood graph; for each matching...

mathematical field of graph theory, the Hall–Janko graph, also known as the Hall-Janko-Wales graph, is a 36-regular undirected graph with 100 vertices and...

mathematical field of graph theory, the Petersen graph is an undirected graph with 10 vertices and 15 edges. It is a small graph that serves as a useful...

is one of the four (5,5)-cage graphs, the others being the Foster cage, the Robertson–Wegner graph, and the Wong graph. It has chromatic number 3, diameter...

graphs, the others being the Foster cage, the Meringer graph, and the Robertson–Wegner graph. Like the unrelated Harries–Wong graph, it is named after Pak-Ken...

It is one of the four (5,5)-cage graphs, the others being the Foster cage, the Meringer graph, and the Wong graph. It has chromatic number 4, diameter...

Tutte–Coxeter graph, the Dodecahedral graph, the Desargues graph, Tutte 12-cage, the Biggs–Smith graph, and the Foster graph. Bang, S.; Dubickas, A.; Koolen...

symmetric graphs. The whole list of cubic symmetric graphs is now named after him the Foster Census and inside this list the Nauru graph is numbered graph F24A...

field of graph theory, the Coxeter graph is a 3-regular graph with 28 vertices and 42 edges. It is one of the 13 known cubic distance-regular graphs. It is...

various individual (finite) graphs. The columns 'vertices', 'edges', 'radius', 'diameter', 'girth', 'P' (whether the graph is planar), χ (chromatic number)...

symbol {7,3}8. According to the Foster census, the Klein graph, referenced as F056B, is the only cubic symmetric graph on 56 vertices which is not bipartite...

In the mathematical field of graph theory, a distance-transitive graph is a graph such that, given any two vertices v and w at any distance i, and any...

field of graph theory, the Pappus graph is a bipartite, 3-regular, undirected graph with 18 vertices and 27 edges, formed as the Levi graph of the Pappus...

In the mathematical field of graph theory, the Ljubljana graph is an undirected bipartite graph with 112 vertices and 168 edges, rediscovered in 2002 and...

In graph theory, a locally linear graph is an undirected graph in which every edge belongs to exactly one triangle. Equivalently, for each vertex of the...

In graph theory, total coloring is a type of graph coloring on the vertices and edges of a graph. When used without any qualification, a total coloring...

edge. According to the Foster census, the F26A graph is the only cubic symmetric graph on 26 vertices. It is also a Cayley graph for the dihedral group...

According to the Foster census, the Biggs–Smith graph, referenced as F102A, is the only cubic symmetric graph on 102 vertices. The Biggs–Smith graph is also uniquely...

Foster census, the Dyck graph, referenced as F32A, is the only cubic symmetric graph on 32 vertices. The characteristic polynomial of the Dyck graph is...

In the mathematical field of graph theory, the Möbius–Kantor graph is a symmetric bipartite cubic graph with 16 vertices and 24 edges named after August...

In the mathematical field of graph theory, LCF notation or LCF code is a notation devised by Joshua Lederberg, and extended by H. S. M. Coxeter and Robert...

parallel combinations. MacMahon called these graphs yoke-chains. Ronald M. Foster in 1932 categorised graphs by their nullity or rank and provided charts...

this class of graphs was coined by R. M. Foster in a 1966 letter to H. S. M. Coxeter. In the context of group theory, zero-symmetric graphs are also called...

halved Foster graph is one of finitely many degree-6 distance-regular locally linear graphs. Every graph G is the bipartite half of another graph, formed...