Search Results for ""

An antilinear operator A^~ satisfies the following two properties: A^~[f_1(x)+f_2(x)] = A^~f_1(x)+A^~f_2(x) (1) A^~cf(x) = c^_A^~f(x), (2) where c^_ is the complex conjugate ...

The Bellman-Ford algorithm is an algorithm for solving the shortest path problem, i.e., finding a graph geodesic between two given vertices. Other algorithms that can be used ...

Connectivity properties obey the following hierarchy: convex => star convex => pathwise-connected => connected.

A schematic mathematical illustration showing the relationships between or properties of mathematical objects.

The Dutch windmill graph D_3^((m)), also called a friendship graph, is the graph obtained by taking m copies of the cycle graph C_3 with a vertex in common (Gallian 2007), ...

The French metro metric is an example for disproving apparently intuitive but false properties of metric spaces. The metric consists of a distance function on the plane such ...

The Goldberg graphs are a family of graphs discovered by Goldberg (1981) which are snarks for n=5, 7, 9, .... Precomputed properties of Goldberg graphs are implemented in the ...

A measure algebra which has many properties associated with the convolution measure algebra of a group, but no algebraic structure is assumed for the underlying space.

An involutive algebra is an algebra A together with a map a|->a^* of A into A (a so-called involution), satisfying the following properties: 1. (a^*)^*=a. 2. (ab)^*=b^*a^*. ...

Let the center B of a circle of radius a move along a line BA. Let O be a fixed point located a distance c away from AB. Draw a secant line through O and D, the midpoint of ...