Polyhedral Graph is A graph made up of the vertices and edges of a polyhedron. Polyhedral graphs are always planar.
In geometric graph theory, a branch of mathematics, a polyhedral graph is the undirected graph formed from the vertices and edges of aconvex polyhedron. According to Steinitz's theorem, the polyhedral graphs may also be characterized in purely graph-theoretic terms, as the 3-vertex-connected planar graphs.
No comments:
Post a Comment