Search Results for ""

An automorphism which interchanges the two vertices of a regular map at each edge without interchanging the vertices.

The ratio of the absolute frequency to the total number of data points in a frequency distribution.

Every continuous linear functional U[f] for f in C[a,b] can be expressed as a Stieltjes integral U[f]=int_a^bf(x)dw(x), where w(x) is determined by U and is of bounded ...

A pseudocylindrical map projection which distorts shape, area, scale, and distance to create attractive average projection properties.

A graph G whose line graph is L(G) is called the root graph R(L(G)) of L(G). In order words, R(L(G))=G. The root graph of a connected graph is unique except for K_3=C_3 (the ...

Let R+B be the number of monochromatic forced triangles (where R and B are the number of red and blue triangles) in an extremal graph. Then R+B=(n; 3)-|_1/2n|_1/4(n-1)^2_|_|, ...

A sorting method proposed by Shell (1959) in which records being sorted can take long jumps instead of being restricted to short steps.

Let v(G) be the number of vertices in a graph G and h(G) the length of the maximum cycle in G. Then the shortness exponent of a class of graphs G is defined by sigma(G)=lim ...

Two triangles are similar if their triples of vertex angles are the same.

The single bar | is a notation variously used to denote the absolute value |x|, complex modulus |z|, vector norm |x|, determinant |A|, or "divides" (a|b).