Search Results for ""

A schematic diagram used in logic theory to depict collections of sets and represent their relationships. The Venn diagrams on two and three sets are illustrated above. The ...

The vertex connectivity kappa(G) of a graph G, also called "point connectivity" or simply "connectivity," is the minimum size of a vertex cut, i.e., a vertex subset S subset= ...

A graph G on more than two vertices is said to be k-connected (or k-vertex connected, or k-point connected) if there does not exist a vertex cut of size k-1 whose removal ...

A q-analog, also called a q-extension or q-generalization, is a mathematical expression parameterized by a quantity q that generalizes a known expression and reduces to the ...

The q-binomial coefficient is a q-analog for the binomial coefficient, also called a Gaussian coefficient or a Gaussian polynomial. A q-binomial coefficient is given by [n; ...

The modern definition of the q-hypergeometric function is _rphi_s[alpha_1,alpha_2,...,alpha_r; beta_1,...,beta_s;q,z] ...

The Petersen graph is the cubic graph on 10 vertices and 15 edges which is the unique (3,5)-cage graph (Harary 1994, p. 175), as well as the unique (3,5)-Moore graph. It can ...

The term "arbelos" means shoemaker's knife in Greek, and this term is applied to the shaded area in the above figure which resembles the blade of a knife used by ancient ...

The circumcircle is a triangle's circumscribed circle, i.e., the unique circle that passes through each of the triangle's three vertices. The center O of the circumcircle is ...

In general, there are two important types of curvature: extrinsic curvature and intrinsic curvature. The extrinsic curvature of curves in two- and three-space was the first ...