Search Results for ""

The wreath graph W(n,k) is the graph obtained by taking n collections of k nodes and arranging around a circle such that all nodes in adjacent collections are connected. ...

The Wagner graph is a name sometimes given to the 4-Möbius ladder (Bondy and Murty 2008, pp. 275-276). The association arises through the theorem of Wagner (1937) that graphs ...

The parameters alpha, beta, gamma, and delta which, like the three Euler angles, provide a way to uniquely characterize the orientation of a solid body. These parameters ...

Let X_1,X_2 subset P^2 be cubic plane curves meeting in nine points p_1, ..., p_9. If X subset P^2 is any cubic containing p_1, ..., p_8, then X contains p_9 as well. It is ...

The Kummer graph is the name apparently first adopted here for the Levi graph of Kummer's 16_6 configuration (Coxeter 1950), corresponding to the folded 6-cube graph (Brouwer ...

An antiprism graph is a graph corresponding to the skeleton of an antiprism. Antiprism graphs are therefore polyhedral and planar. The n-antiprism graph has 2n vertices and ...

The Pappus graph is a cubic symmetric distance-regular graph on 18 vertices, illustrated above in three embeddings. It is Hamiltonian and can be represented in LCF notation ...

Given A = |a_(11)-x a_(12) ... a_(1m); a_(21) a_(22)-x ... a_(2m); | | ... |; a_(m1) a_(m2) ... a_(mm)-x| (1) = x^m+c_(m-1)x^(m-1)+...+c_0, (2) then ...

Every finite group of order n can be represented as a permutation group on n letters, as first proved by Cayley in 1878 (Rotman 1995).

The evolute of Cayley's sextic with parametrization x = 4acos^3(1/3theta)cost (1) y = 4acos^3(1/3theta)sint (2) is given by x_e = 1/4[2+3cos(2/3t)-cos(2t)] (3) y_e = ...