Get Math Help

GET TUTORING NEAR ME!

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

    Smallest Cubic Crossing Number Graph

    Alternate name
    Definition

    The smallest cubic graphs with graph crossing number CN(G) = n have been termed "crossing number graphs" or n-crossing graphs by Pegg and Exoo. The n-crossing graphs are implemented in the Wolfram Language as GraphData[CrossingNumberGraphNA], with N being a number and X a letter, for example 3C for the Heawood graph or 8B for cubic symmetric graph F_24 A.

    Related Wolfram Language symbol

    GraphData

    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.