The CubeGraph command creates the cube graph on 8 vertices. A cube is a 3-regular and 6-faced planar graph. As an option, you may input the labels of the vertices as a set or list of size 8.

The DodecahedronGraph command creates the dodecahedron graph on 20 vertices. A dodecahedron is a 3-regular and 12-faced planar graph. As an option, you may input the labels of the vertices as a set or list of size 20.

The IcosahedronGraph command creates the icosahedron graph on 12 vertices. An icosahedron is a 5-regular and 20-faced planar graph. As an option, you may input the labels of the vertices as a set or list of size 12.

The OctahedronGraph command creates the octahedron graph on 6 vertices. As an option, you may input the labels of the vertices as a set or list of size 6.

The TetrahedronGraph command creates the tetrahedron graph (the complete graph) on 4 vertices. As an option, you may input the labels of the vertices as a set or list of size 4.

$\mathrm{with}\left(\mathrm{GraphTheory}\right)\:$

$\mathrm{with}\left(\mathrm{SpecialGraphs}\right)\:$

$C≔\mathrm{CubeGraph}\left(\right)$

$C≔\mathrm{Graph\; 1:\; an\; undirected\; graph\; with\; 8\; vertices\; and\; 12\; edges}$

$\mathrm{DrawGraph}\left(C\right)$

$H≔\mathrm{DodecahedronGraph}\left(\right)$

$H≔\mathrm{Graph\; 2:\; an\; undirected\; graph\; with\; 20\; vertices\; and\; 30\; edges}$

$\mathrm{Neighborhood}\left(H\,19\right)$

$\left[14\,18\,20\right]$

$\mathrm{IsPlanar}\left(H\,'F'\right)$

$\mathrm{true}$

$\mathrm{nops}\left(F\right)$

$12$

$\mathrm{DrawGraph}\left(H\right)$

$K≔\mathrm{IcosahedronGraph}\left(\right)$

$K≔\mathrm{Graph\; 3:\; an\; undirected\; graph\; with\; 12\; vertices\; and\; 30\; edges}$

$\mathrm{IsPlanar}\left(K\,'F'\right)$

$\mathrm{true}$

$\mathrm{map}\left(\mathrm{nops}\,F\right)$

$\left[3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\right]$

$\mathrm{DrawGraph}\left(K\right)$

$G≔\mathrm{OctahedronGraph}\left(\right)$

$G≔\mathrm{Graph\; 4:\; an\; undirected\; graph\; with\; 6\; vertices\; and\; 12\; edges}$

$\mathrm{IsPlanar}\left(G\right)$

$\mathrm{true}$

$\mathrm{DrawGraph}\left(G\right)$

$T≔\mathrm{TetrahedronGraph}\left(\right)$

$T≔\mathrm{Graph\; 5:\; an\; undirected\; graph\; with\; 4\; vertices\; and\; 6\; edges}$

$\mathrm{DrawGraph}\left(T\right)$