Polyhedral Graph

Explore PolyhedralGraph on MathWorld

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.


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.

Classroom Articles on Graph Theory

  • Chromatic Number
  • Directed Graph
  • Complete Graph
  • Graph Cycle
  • Connected Graph
  • Graph Theory
  • Cycle Graph
  • Tree

  • Classroom Articles on Discrete Mathematics (Up to College Level)

  • Algorithm
  • Generating Function
  • Binary
  • Logic
  • Binomial Coefficient
  • Magic Square
  • Binomial Theorem
  • Pascal's Triangle
  • Combinatorics
  • Permutation
  • Discrete Mathematics
  • Recurrence Relation
  • Fibonacci Number