networks
dodecahedron
creates a dodecahedron graph
Calling Sequence
Parameters
Description
Examples
G:=dodecahedron()
G
-
is returned as the dodecahedron.
Important: The networks package has been deprecated. Use the superseding command GraphTheory[SpecialGraphs][DodecahedronGraph] instead.
This routine generates the simple graph known as a dodecahedron.
It is normally loaded via the command with(networks) but may also be referenced using the full name networks[dodecahedron](...).
with⁡networks:
G≔dodecahedron⁡:
edges⁡G
e1,e10,e11,e12,e13,e14,e15,e16,e17,e18,e19,e2,e20,e21,e22,e23,e24,e25,e26,e27,e28,e29,e3,e30,e4,e5,e6,e7,e8,e9
vertices⁡G
0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19
See Also
GraphTheory
GraphTheory[SpecialGraphs][DodecahedronGraph]
networks(deprecated)[icosahedron]
networks(deprecated)[octahedron]
networks(deprecated)[tetrahedron]
Download Help Document