TOPICS
Search

Search Results for ""


1261 - 1270 of 2069 for Cayley graphSearch Results
A finite group is a group having finite group order. Examples of finite groups are the modulo multiplication groups, point groups, cyclic groups, dihedral groups, symmetric ...
The Royle graphs are the two unique simple graphs on eight nodes whose sigma polynomials have nonreal roots (Read and Wilson 1998, p. 265). The sigma polynomials of these ...
The Watkins snark is the snark on 50 vertices ad 75 nodes illustrated above. It is implemented in the Wolfram Language as GraphData["WatkinsSnark"].
A surface which is related to Cayley numbers.
A division algebra, also called a "division ring" or "skew field," is a ring in which every nonzero element has a multiplicative inverse, but multiplication is not ...
A line segment connecting nonadjacent polyhedron vertices sharing a common face in a parallelepiped or other similar solid.
Given a finitely generated Z-graded module M over a graded ring R (finitely generated over R_0, which is an Artinian local ring), the Hilbert function of M is the map ...
The intercept form of a line in the Cartesian plane with x-intercept a and y-intercept b is given by x/a+y/b=1.
Lines that intersect in a point are called intersecting lines. Lines that do not intersect are called parallel lines in the plane, and either parallel or skew lines in ...
The line bisecting a given line segment P_1P_2 can be constructed geometrically, as illustrated above.
1 ... 124|125|126|127|128|129|130 ... 207 Previous Next

...