TOPICS
Search

Search Results for ""


1281 - 1290 of 1812 for Cayley graphsSearch Results
A fusene is a simple planar 2-connected graph embedded in the plane with all vertices of degree 2 or 3, all bounded faces (not necessarily regular) hexagons, and all vertices ...
A quantitative measure of the simplicity of a geometric construction which reduces geometric constructions to five steps. It was devised by È. Lemoine. S_1 Place a ...
The Goddard-Henning enneahedron, a term coined here, is the canonical polyhedron obtained from the Goddard-Henning graph. It has 9 vertices, 16 edges (consisting of 3 ...
The Goldner-Harary polyhedron is the term given in this work to the polyhedral embedding of the Goldner-Harary graph. This solid is an augmented triangular dipyramid, a ...
The Herschel nonahedron is a canonical polyhedron whose skeleton is the Herschel graph. It has 11 vertices, 18 edges, and 9 faces. Of the edges, 6 are short and 12 are long. ...
The term "integral" can refer to a number of different concepts in mathematics. The most common meaning is the the fundamenetal object of calculus corresponding to summing ...
In calculus, geometry, and plotting contexts, the term "linear function" means a function whose graph is a straight line, i.e., a polynomial function of degree 0 or 1. A ...
There are several different definition of link. In knot theory, a link is one or more disjointly embedded circles in three-space. More informally, a link is an assembly of ...
The term "loop" has a number of meanings in mathematics. Most simply, a loop is a closed curve whose initial and final points coincide in a fixed point p known as the ...
Given a complete graph K_n which is two-colored, the number of forced monochromatic triangles is at least {1/3u(u-1)(u-2) for n=2u; 2/3u(u-1)(4u+1) for n=4u+1; ...
1 ... 126|127|128|129|130|131|132 ... 182 Previous Next

...