Search Results for ""

Fisher's exact test is a statistical test used to determine if there are nonrandom associations between two categorical variables. Let there exist two such variables X and Y, ...

Let G be a finite graph and v a vertex of G. The stabilizer of v, stab(v), is the set of group elements {g in Aut(G)|g(v)=v}, where Aut(g) is the graph automorphism group. ...

Let C^*(u) denote the number of nowhere-zero u-flows on a connected graph G with vertex count n, edge count m, and connected component count c. This quantity is called the ...

A graph is a forbidden minor if its presence as a graph minor of a given graph means it is not a member of some family of graphs. More generally, there may be a family of ...

Four-dimensional geometry is Euclidean geometry extended into one additional dimension. The prefix "hyper-" is usually used to refer to the four- (and higher-) dimensional ...

The squared norm of a four-vector a=(a_0,a_1,a_2,a_3)=a_0+a is given by the dot product a^2=a_mua^mu=(a^0)^2-a·a, (1) where a·a is the usual vector dot product in Euclidean ...

A rational number expressed in the form a/b (in-line notation) or a/b (traditional "display" notation), where a is called the numerator and b is called the denominator. When ...

A number of strongly regular graphs of several types derived from combinatorial design were identified by Goethals and Seidel (1970). Theorem 2.4 of Goethals and Seidel ...

Let theta(t) be the Riemann-Siegel function. The unique value g_n such that theta(g_n)=pin (1) where n=0, 1, ... is then known as a Gram point (Edwards 2001, pp. 125-126). An ...

An automorphism of a graph is a graph isomorphism with itself, i.e., a mapping from the vertices of the given graph G back to vertices of G such that the resulting graph is ...