Search Results for ""

An unfolding is the cutting along edges and flattening out of a polyhedron to form a net. Determining how to unfold a polyhedron into a net is tricky. For example, cuts ...

A web diagram, also called a cobweb plot, is a graph that can be used to visualize successive iterations of a function y=f(x). In particular, the segments of the diagram ...

If the rank polynomial R(x,y) of a graph G is given by sumrho_(rs)x^ry^s, then rho_(rs) is the number of subgraphs of G with rank r and co-rank s, and the matrix (rho_(rs)) ...

Riddell's formula for unlabeled graphs is the Euler transform relating the number of unlabeled connected graphs on n nodes satisfying some property with the corresponding ...

A Ramsey number of the form R(k,k;2).

It is conjectured that every tree with e edges whose nodes are all trivalent or monovalent can be given a "magic" labeling such that the integers 1, 2, ..., e can be assigned ...

If G^' is a subgraph of G, then G is said to be a supergraph of G^'.

Given n matches (i.e., rigid unit line segments), find the number of topologically distinct planar arrangements which can be made (Gardner 1991). In this problem, two matches ...

LCF notation is a concise and convenient notation devised by Joshua Lederberg (winner of the 1958 Nobel Prize in Physiology and Medicine) for the representation of cubic ...

A column-convex self-avoiding polygon which contains the bottom edge of its minimal bounding rectangle. The anisotropic perimeter and area generating function ...