Search Results for ""

The truncated octahedral graph is the cubic Archimedean graph on 24 nodes and 36 edges that is the skeleton of the truncated octahedron. It is isomorphic to the Bruhat graph ...

Given a graph G, the arboricity Upsilon(G) is the minimum number of edge-disjoint acyclic subgraphs (i.e., spanning forests) whose union is G. An acyclic graph therefore has ...

Let a cone of opening parameter c and vertex at (0,0,0) intersect a sphere of radius r centered at (x_0,y_0,z_0), with the cone oriented such that its axis does not pass ...

A doublecross graph is a graph with graph crossing number 2. The numbers of doublecross simple graphs on n=1 nodes are 0, 0, 0, 0, 0, 1, 39, ..., and the numbers of connected ...

An equichordal point is a point p for which all the chords of a curve C passing through p are of the same length. In other words, p is an equichordal point if, for every ...

The four-color theorem states that any map in a plane can be colored using four-colors in such a way that regions sharing a common boundary (other than a single point) do not ...

Geometry is the study of figures in a space of a given number of dimensions and of a given type. The most common types of geometry are plane geometry (dealing with objects ...

Given a "good" graph G (i.e., one for which all intersecting graph edges intersect in a single point and arise from four distinct graph vertices), the crossing number is the ...

A grid usually refers to two or more infinite sets of evenly-spaced parallel lines at particular angles to each other in a plane, or the intersections of such lines. The two ...

The gyroelongated pentagonal pyramid is Johnson solid J_(11) and can be obtained by cumulating the top of a pentagonal antiprism, or alternately by replacing one pentagonal ...