Search Results for ""
11 - 20 of 2069 for Cayley graphSearch Results
View search results from all Wolfram sites (12725 matches)In affine three-space the Cayley surface is given by x_3=x_1x_2-1/3x_1^3 (1) (Nomizu and Sasaki 1994). The surface has been generalized by Eastwood and Ezhov (2000) to ...
A plane curve discovered by Maclaurin but first studied in detail by Cayley. The name Cayley's sextic is due to R. C. Archibald, who attempted to classify curves in a paper ...
The only nonassociative division algebra with real scalars. There is an 8-square identity corresponding to this algebra. The elements of a Cayley algebra are called Cayley ...
The 60 Pascal lines of a hexagon inscribed in a conic intersect three at a time through 20 Steiner points, and also three at a time in 60 Kirkman points. Each Steiner point ...
The linear fractional transformation z|->(i-z)/(i+z) that maps the upper half-plane {z:I[z]>0} conformally onto the unit disk {z:|z|<1}.
Cayley's cubic surface is the unique cubic surface having four ordinary double points (Hunt), the maximum possible for cubic surface (Endraß). The Cayley cubic is invariant ...
The Franklin graph is the 12-vertex cubic graph shown above whose embedding on the Klein bottle divides it into regions having a minimal coloring using six colors, thus ...
An empty graph on n nodes consists of n isolated nodes with no edges. Such graphs are sometimes also called edgeless graphs or null graphs (though the term "null graph" is ...
A graph in which each graph edge is replaced by a directed graph edge, also called a digraph. A directed graph having no multiple edges or loops (corresponding to a binary ...
The n-Andrásfai graph is a circulant graph on 3n-1 nodes whose indices are given by the integers 1, ..., 3n-1 that are congruent to 1 (mod 3). The Andrásfai graphs have graph ...
...