Polyhedral Graph
 |
|
A polyhedral graph is a network made up of the vertices and edges of a polyhedron. Polyhedral graphs are always planar.
Polyhedral graph is a college-level concept that would be first encountered in a discrete mathematics course covering graph theory.
Prerequisites
| Graph: | In graph theory, a graph, also called a network, is a collection of points together with lines that connect some subset of the points. |
| Planar Graph: | A planar graph is a network that can be drawn in a plane without any edges intersecting. |
| Polyhedron: | A polyhedron is a three-dimensional solid that consists of a collection of polygons, joined at their edges. |