Search Results for ""

The number of outward directed graph edges from a given graph vertex in a directed graph.

Let I be a set, and let U be an ultrafilter on I, let phi be a formula of a given language L, and let {A_i:i in I} be any collection of structures which is indexed by the set ...

A product space product_(i in I)X_i is compact iff X_i is compact for all i in I. In other words, the topological product of any number of compact spaces is compact. In ...

Let alpha(G) denote the independence number of a graph G. Then the Shannon capacity Theta(G), sometimes also denoted c(G), of G is defined as ...

Two vectors u and v are parallel if their cross product is zero, i.e., uxv=0.

The shortest path-spanning tree from a graph vertex of a graph.

Let V be an inner product space and let x,y,z in V. Hlawka's inequality states that ||x+y||+||y+z||+||z+x||<=||x||+||y||+||z||+||x+y+z||, where the norm ||z|| denotes the ...

A generalized hexagon is a generalized polygon of order 6. GH(1,2) is more commonly known as the Heawood graph, but is also the (3,6)-cage graph, the cubic vertex-transitive ...

The multiplicative subgroup of all elements in the product of the multiplicative groups k_nu^× whose absolute value is 1 at all but finitely many nu, where k is a number ...

A tree G^' whose graph vertices and graph edges form subsets of the graph vertices and graph edges of a given tree G.