Search Results for ""

A binary tree is a tree-like structure that is rooted and in which each vertex has at most two children and each child of a vertex is designated as its left or right child ...

Cantellation, also known as (polyhedron) expansion (Stott 1910, not to be confused with general geometric expansion) is the process of radially displacing the edges or faces ...

A caterpillar graph, caterpillar tree, or simply "caterpillar," is a tree in which every graph vertex is on a central stalk or only one graph edge away from the stalk (in ...

The (connected) caveman graph is a graph arising in social network theory formed by modifying a set of isolated k-cliques (or "caves") by removing one edge from each clique ...

Let P(G) denote the chromatic polynomial of a finite simple graph G. Then G is said to be chromatically unique if P(G)=P(H) implies that G and H are isomorphic graphs, in ...

The circumradius of a cyclic polygon is a radius of the circle inside which the polygon can be inscribed. Similarly, the circumradius of a polyhedron is the radius of a ...

The clique polynomial C_G(x) for the graph G is defined as the polynomial C_G(x)=1+sum_(k=1)^(omega(G))c_kx^k, (1) where omega(G) is the clique number of G, the coefficient ...

The "contiguous USA graph" is the graph whose vertices represent the contiguous 48 states of the United States plus the District of Columbia (DC) and whose edges connect ...

There are several attractive polyhedron compounds consisting of three cubes. The first (left figures) arises by joining three cubes such that each shares two C_2 axes (Holden ...

Cube duplication, also called the Delian problem, is one of the geometric problems of antiquity which asks, given the length of an edge of a cube, that a second cube be ...