Get Math Help

GET TUTORING NEAR ME!

By submitting the following form, you agree to Club Z!'s Terms of Use and Privacy Policy

    C-net

    Alternate name
    Basic definition

    A polyhedral graph is a network made up of the vertices and edges of a polyhedron. Polyhedral graphs are always planar.

    Detailed definition

    An n-polyhedral graph (sometimes called a c-net) is a 3-connected simple planar graph on n nodes. Every convex polyhedron can be represented in the plane or on the surface of a sphere by a 3-connected planar graph. Conversely, by a theorem of Steinitz as restated by Grünbaum, every 3-connected planar graph can be realized as a convex polyhedron. Polyhedral graphs are sometimes simply known as "polyhedra" (which is rather confusing since the term "polyhedron" more commonly refers to a solid with n faces, not n vertices).

    Educational grade level

    college level

    Find the right fit or it’s free.

    We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.