Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a22d007a9fbad287

Jump to content

Foster cage

From Wikipedia, the free encyclopedia
Foster cage
Named afterRonald Martin Foster
Vertices30
Edges75
Radius3
Diameter3
Girth5
Automorphisms30
Chromatic number4
Chromatic index5
PropertiesCage
Table of graphs and parameters

In the mathematical field of graph theory, the Foster cage is a 5-regular undirected graph with 30 vertices and 75 edges.[1][2] It is one of the four (5,5)-cage graphs, the others being the Meringer graph, the Robertson–Wegner graph, and the Wong graph.

Like the unrelated Foster graph, it is named after R. M. Foster.

It has chromatic number 4, diameter 3, and is 5-vertex-connected.

Algebraic properties

[edit]

The characteristic polynomial of the Foster cage is

References

[edit]
  1. Weisstein, Eric W. "Foster Cage". MathWorld.
  2. Meringer, Markus (1999), "Fast generation of regular graphs and construction of cages", Journal of Graph Theory, 30 (2): 137–146, doi:10.1002/(SICI)1097-0118(199902)30:2<137::AID-JGT7>3.0.CO;2-G, MR 1665972.