Dodecagram
Encyclopedia
A dodecagram is a star polygon that has twelve vertices
. There is 1 regular form: {12/5}.
All dodecagrams share the vertices of a dodecagon
, which may be regarded as {12/1}.
and the last is a compound of four triangle
s.
compound of six digon
s (line segments), {12/6} - produces the complete graph
K12.
Vertex (geometry)
In geometry, a vertex is a special kind of point that describes the corners or intersections of geometric shapes.-Of an angle:...
. There is 1 regular form: {12/5}.
All dodecagrams share the vertices of a dodecagon
Dodecagon
In geometry, a dodecagon is any polygon with twelve sides and twelve angles.- Regular dodecagon :It usually refers to a regular dodecagon, having all sides of equal length and all angles equal to 150°...
, which may be regarded as {12/1}.
Star figures
There are 3 regular dodecagram star figures, {12/2}, {12/3} and {12/4}. The first is a compound of two hexagons, the second is a compound of three squaresSquare (geometry)
In geometry, a square is a regular quadrilateral. This means that it has four equal sides and four equal angles...
and the last is a compound of four triangle
Triangle
A triangle is one of the basic shapes of geometry: a polygon with three corners or vertices and three sides or edges which are line segments. A triangle with vertices A, B, and C is denoted ....
s.
Complete graph
Superimposing all the dodecagons and dodecagrams on each other - including the degenerateDegeneracy (mathematics)
In mathematics, a degenerate case is a limiting case in which a class of object changes its nature so as to belong to another, usually simpler, class....
compound of six digon
Digon
In geometry, a digon is a polygon with two sides and two vertices. It is degenerate in a Euclidean space, but may be non-degenerate in a spherical space.A digon must be regular because its two edges are the same length...
s (line segments), {12/6} - produces the complete graph
Complete graph
In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge.-Properties:...
K12.