Search Results for ""

A lattice path from one point to another is p-good if it lies completely below the line y=(p-1)x. (1) Hilton and Pederson (1991) show that the number of p-good paths from (1, ...

The x-axis is the horizontal axis of a two-dimensional plot in Cartesian coordinates that is conventionally oriented to point to the right (left figure). In three dimensions, ...

A block graph, also called a clique tree, is a simple graph in which every block is a complete graph. The numbers of connected block graphs on n=1, 2, ... vertices are 1, 1, ...

The Coxeter graph is a nonhamiltonian cubic symmetric graph on 28 vertices and 42 edges which can be constructed as illustrated above. It can also be constructed as the graph ...

It is especially convenient to specify planes in so-called Hessian normal form. This is obtained from the general equation of a plane ax+by+cz+d=0 (1) by defining the ...

A k×m×n hexagonal grid graph is a graph of adjoined hexagons consisting of k hexagons along the horizontal triangular axis, m along the northeast axis, and n along the ...

The skeleton graphs of the Johnson solids are polyhedral graphs. The Johnson skeleton graphs J_3 and J_(63) are minimal unit-distance forbidden graphs. The skeleton of the ...

A Mongolian tent graph is defined as the graph obtained from the grid graph P_m square P_n for odd n by adding an extra vertex above the graph and joining every other vertex ...

Let two disks of radius r intersect one another perpendicularly and have a diameter in common. If the distance between the centers of the disks is sqrt(2) times their radius, ...

Two or more lines are said to be concurrent if they intersect in a single point. Two lines concur if their trilinear coordinates satisfy |l_1 m_1 n_1; l_2 m_2 n_2; l_3 m_3 ...