Search Results for ""

The Barnette-Bosák-Lederberg graph is a graph on 38 vertices which is the smallest known example of a planar 3-connected nonhamiltonian graph, i.e., the smallest known ...

The Klein graph is a weakly regular graph that is the dual graph of the cubic symmetric graph F_(056)B. The Klein graph is illustrated above in four order-4 LCF notations. ...

The tetrakis hexahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

An alpha value is a number 0<=alpha<=1 such that P(z>=z_(observed))<=alpha is considered "significant," where P is a P-value.

If f is continuous on a closed interval [a,b], then there is at least one number x^* in [a,b] such that int_a^bf(x)dx=f(x^*)(b-a). The average value of the function (f^_) on ...

A necessary and sufficient condition for a sequence S_i to converge. The Cauchy criterion is satisfied when, for all epsilon>0, there is a fixed number N such that ...

If an infinite number of points in the plane are all separated by integer distances, then all the points lie on a straight line.

A curve created by starting with a circle, dividing it into six arcs, and flipping three alternating arcs. The process is then repeated an infinite number of times.

A group having an infinite number of elements. Some infinite groups, such as the integers or rationals, are not continuous groups.

The sequence generated by repeated application of a map. The map is said to have a closed orbit if it has a finite number of elements.