Search Results for ""

The Gray graph is a cubic semisymmetric graph on 54 vertices. It was discovered by Marion C. Gray in 1932, and was first published by Bouwer (1968). Malnič et al. (2002) ...

An ideal is a subset I of elements in a ring R that forms an additive group and has the property that, whenever x belongs to R and y belongs to I, then xy and yx belong to I. ...

The Meringer graph is one of the four (5,5)-cage graphs, discovered by Meringer (1999) after it had long been thought that only three such cages existed. Like the other ...

Let F(n,sigma) denote the number of permutations on the symmetric group S_n which avoid sigma in S_k as a subpattern, where "tau contains sigma as a subpattern" is ...

The tetrakis hexahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

The truncated octahedron is the 14-faced Archimedean solid with faces 8{6}+6{4}. It is also the uniform polyhedron with Maeder index 8 (Maeder 1997), Wenninger index 7 ...

The truncated tetrahedral graph is the cubic Archimedean graph on 12 nodes and 18 edges that is the skeleton of the truncated tetrahedron. It is implemented in the Wolfram ...

Gives a matrix representation b_i of a braid group in terms of (n-1)×(n-1) matrices. A -t always appears in the (i,i) position. b_1 = [-t 0 0 ... 0; -1 1 0 ... 0; 0 0 1 ... ...

An isosceles trapezoid (called an isosceles trapezium by the British; Bronshtein and Semendyayev 1997, p. 174) is trapezoid in which the base angles are equal and therefore ...

If x takes only nonnegative values, then P(x>=a)<=(<x>)/a. (1) To prove the theorem, write <x> = int_0^inftyxP(x)dx (2) = int_0^axP(x)dx+int_a^inftyxP(x)dx. (3) Since P(x) is ...