Search Results for ""

Let a graph G=(V,E) be defined on vertex set V and edge set E. Then a construction sequence (or c-sequence) for G is a linear order on V union E in which each edge appears ...

The term "God's number" is sometimes given to the graph diameter of Rubik's graph, which is the minimum number of turns required to solve a Rubik's cube from an arbitrary ...

A sequence s_n^((lambda))(x)=[h(t)]^lambdas_n(x), where s_n(x) is a Sheffer sequence, h(t) is invertible, and lambda ranges over the real numbers is called a Steffensen ...

If a, b, c, and d are points in the extended complex plane C^*, their cross ratio, also called the cross-ratio (Courant and Robbins 1996, p. 172; Durell 1928, p. 73), ...

If P=p:q:r and U=u:v:w are distinct trilinear points, neither lying on a sideline of the reference triangle DeltaABC, then the crosssum of P and U is the point ...

The rule which determines the orientation of the cross product u×v. The right-hand rule states that the orientation of the vectors' cross product is determined by placing u ...

The global clustering coefficient C of a graph G is the ratio of the number of closed trails of length 3 to the number of paths of length two in G. Let A be the adjacency ...

A minimal edge cover is an edge cover of a graph that is not a proper subset of any other edge cover. Every minimum edge cover is a minimal edge cover, but the converse does ...

A vector field u satisfying the vector identity ux(del xu)=0 where AxB is the cross product and del xA is the curl is said to be a Beltrami field.

The rotation operator can be derived from examining an infinitesimal rotation (d/(dt))_(space)=(d/(dt))_(body)+omegax, where d/dt is the time derivative, omega is the angular ...