Search Results for ""

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, ... ...

Let A be an edge cut of a connected graph G. Then the cyclic edge connectivity lambda_c(G) is the size of a smallest cyclic edge cut, i.e., a smallest edge cut A such that ...

The cycloid is the locus of a point on the rim of a circle of radius a rolling along a straight line. It was studied and named by Galileo in 1599. Galileo attempted to find ...

The dilogarithm Li_2(z) is a special case of the polylogarithm Li_n(z) for n=2. Note that the notation Li_2(x) is unfortunately similar to that for the logarithmic integral ...

A discontinuity is point at which a mathematical object is discontinuous. The left figure above illustrates a discontinuity in a one-variable function while the right figure ...

A division algebra, also called a "division ring" or "skew field," is a ring in which every nonzero element has a multiplicative inverse, but multiplication is not ...

Eigenvalues are a special set of scalars associated with a linear system of equations (i.e., a matrix equation) that are sometimes also known as characteristic roots, ...

An equilateral triangle is a triangle with all three sides of equal length a, corresponding to what could also be known as a "regular" triangle. An equilateral triangle is ...

Experimental mathematics is a type of mathematical investigation in which computation is used to investigate mathematical structures and identify their fundamental properties ...