Search Results for ""

The two-dimensional Euclidean space denoted R^2.

The coordinates representing any point of an n-dimensional affine space A by an n-tuple of real numbers, thus establishing a one-to-one correspondence between A and R^n. If V ...

Call a graph vertex m(a,b,c) a median of a graph G if it lies on all shortest paths between each pair of vertices (a,b), (b,a), and (c,a) in G. A median graph is then defined ...

Let gamma(G) denote the domination number of a simple graph G. Then Vizing (1963) conjectured that gamma(G)gamma(H)<=gamma(G×H), where G×H is the graph product. While the ...

The n-crown graph for an integer n>=3 is the graph with vertex set {x_0,x_1,...,x_(n-1),y_0,y_1,...,y_(n-1)} (1) and edge set {(x_i,y_j):0<=i,j<=n-1,i!=j}. (2) It is ...

An (ordinary) torus is a surface having genus one, and therefore possessing a single "hole" (left figure). The single-holed "ring" torus is known in older literature as an ...

Differential Equations

The composition G=G_1[G_2] of graphs G_1 and G_2 with disjoint point sets V_1 and V_2 and edge sets X_1 and X_2 is the graph with point vertex V_1×V_2 and u=(u_1,u_2) ...

An n-dimensional vector, i.e., a vector (x_1, x_2, ..., x_n) with n components. In dimensions n greater than or equal to two, vectors are sometimes considered synonymous with ...

A contravariant tensor is a tensor having specific transformation properties (cf., a covariant tensor). To examine the transformation properties of a contravariant tensor, ...