Search Results for ""

A dissection fallacy is an apparent paradox arising when two plane figures with different areas seem to be composed by the same finite set of parts. In order to produce this ...

A proof based on a dissection which shows the formula for the area of a plane figure or of the volume of a solid. Dozens of different dissection proofs are known for the ...

A puzzle in which one object is to be converted to another by making a finite number of cuts and reassembling it. The cuts are often, but not always, restricted to straight ...

A dynamical system in which the phase space volume contracts along a trajectory. This means that the generalized divergence is less than zero, (partialf_i)/(partialx_i)<0, ...

An object that is not superimposable on its mirror image is said to be dissymmetric. All asymmetric objects are dissymmetric, and an object with no improper rotation ...

A distance-heredity graph, also known as a completely separable graph, is a graph G such that the distance matrix of every connected vertex-induced subgraph G_V of G is the ...

A connected graph G is distance-regular if for any vertices x and y of G and any integers i,j=0, 1, ...d (where d is the graph diameter), the number of vertices at distance i ...

A graph G is distance transitive if its automorphism group is transitive on pairs of vertices at each pairwise distance in the graph. Distance-transitivity is a ...

The distance between two points is the length of the path connecting them. In the plane, the distance between points (x_1,y_1) and (x_2,y_2) is given by the Pythagorean ...

Let D be a set of positive numbers containing 1, then the D-distance graph X(D) on a nonempty subset X of Euclidean space is the graph with vertex set X and edge set ...