Search Results for ""
11 - 20 of 1124 for Wallis's conical edgeSearch Results
View search results from all Wolfram sites (5046 matches)int_0^(pi/2)cos^nxdx = int_0^(pi/2)sin^nxdx (1) = (sqrt(pi)Gamma(1/2(n+1)))/(nGamma(1/2n)) (2) = ((n-1)!!)/(n!!){1/2pi for n=2, 4, ...; 1 for n=3, 5, ..., (3) where Gamma(n) ...
A generalization of the Wilcoxon rank sum test.
In conical coordinates, Laplace's equation can be written ...
In conical coordinates, Laplace's equation can be written ...
An edge cover is a subset of edges defined similarly to the vertex cover (Skiena 1990, p. 219), namely a collection of graph edges such that the union of edge endpoints ...
An edge automorphism of a graph G is a permutation of the edges of G that sends edges with common endpoint into edges with a common endpoint. The set of all edge ...
The edge set of a graph is simply a set of all edges of the graph. The cardinality of the edge set for a given graph g is known as the edge count of g. The edge set for a ...
An edge cut (Holton and Sheehan 1993, p. 14; West 2000, p. 152), edge cut set, edge cutset (Holton and Sheehan 1993, p. 14), or sometimes simply "cut set" or "cutset" (e.g., ...
An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...
The edge connectivity, also called the line connectivity, of a graph is the minimum number of edges lambda(G) whose deletion from a graph G disconnects G. In other words, it ...
...