Cubic Map And Its Graph Cross The Number Of Problems

Using the algorithm CCN ( Calculate Crossing Number ), this article researches on the relation between the crossing number and girth of the 3-regular graphs. It invests all 3-regular graphs with order at most 18, all 3-regular generalized Petersen graphs with order at most 30, all 3-regular graphs with maximum girth and order from 20 to 30 , some random 3-regular graphs with order from 20 to 30, and all Circulant Graphs Cn(l,k) with order at most 18. In this article, it is shown that the average crossing number of 3-regular graphs with biggest girth and order n (18) is greater than that of all 3-regular graphs. It also gives the crossing number's relation between Circulant Graphs Cn(1,k) and generalized Petersen graphs.