Foster graph
id:
foster-graph-233-4093819
title:
Foster graph
text:
In the 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 chromatic number 2, chromatic index 3, radius 8, diameter 8 and girth 10. It is also a 3-vertex-connected and 3-edge-connected graph. It has queue number 2 and the upper bound on the book thickness is 4. All the cubic distance-regular graphs are known. The Foster graph is one of the 13 such graphs. It is the unique distance-transitive
brand slug:
wiki
category slug:
encyclopedia
description:
Bipartite 3-regular graph with 90 vertices and 135 edges
original url:
https://en.wikipedia.org/wiki/Foster_graph
date created:
date modified:
2024-02-27T06:49:09Z
main entity:
{"identifier":"Q3115485","url":"https://www.wikidata.org/entity/Q3115485"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/f/fc/Foster_graph.svg","width":600,"height":600}
fields total:
13
integrity:
15