Search Results for ""

The cotangent function cotz is the function defined by cotz = 1/(tanz) (1) = (i(e^(iz)+e^(-iz)))/(e^(iz)-e^(-iz)) (2) = (i(e^(2iz)+1))/(e^(2iz)-1), (3) where tanz is the ...

The self-intersection of a one-sided surface. The word "cross-cap" is sometimes also written without the hyphen as the single word "crosscap." The cross-cap can be thought of ...

The cross graph is the 6-vertex tree illustrated above. It is implemented in the Wolfram Language as GraphData["CrossGraph"].

The cube-connected cycle graph of order n is the graph obtained by replacing each vertex in a n-dimensional hypercube by a cycle of length n. They were introduced by ...

There are a number of attractive polyhedron compounds consisting of five cubes. The first of these (left figures) consists of the arrangement of five cubes in the polyhedron ...

The average distance between two points chosen at random inside a unit cube (the n=3 case of hypercube line picking), sometimes known as the Robbins constant, is Delta(3) = ...

There are three types of cubic lattices corresponding to three types of cubic close packing, as summarized in the following table. Now that the Kepler conjecture has been ...

Cubic graphs, also called trivalent graphs, are graphs all of whose nodes have degree 3 (i.e., 3-regular graphs). Cubic graphs on n nodes exists only for even n (Harary 1994, ...

A cubic polyhedral graph is a graph that is both cubic and polyhedral. The numbers of cubical polyhedral graphs on n=2, 4, ... nodes are 0, 1, 1, 2, 5, 14, 50, 233, 1249, ... ...

A cubic semisymmetric graph is a graph that is both cubic (i.e., regular of degree 3) and semisymmetric (i.e., edge- but not vertex-transitive). The four smallest cubic ...