Get Math Help

GET TUTORING NEAR ME!

(800) 434-2582

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

    Home / Get Math Help

    Triangulated Graph

    Alternate name
    Definition

    A planar graph G is said to be triangulated (also called maximal planar) if the addition of any edge to G results in a nonplanar graph. If the special cases of the triangle graph C_3 and tetrahedral graph K_4 (which are planar that already contain a maximal number of edges) are included, maximal planar graphs are the skeletons of simple polyhedra and are isomorphic to planar graphs with 3n - 6 edges. Triangulated graphs are implemented in the Wolfram Language as GraphData[Triangulated]. Apollonian networks are triangulated graphs. The following table summarizes some named triangulated graphs.

    Related Wolfram Language symbol

    GraphData

    Back to List | POWERED BY THE WOLFRAM LANGUAGE