Not More Than Nine Vertex Crossing Numbers Of Graphs

Using the algorithm CCN(Calculate Crossing Number) invented by us, we investigate the crossing numbers of all graphs for n<9. Since the crossing numbers of graph equal the sum of the crossing numbers of all its 2-connected blocks, we work on the crossing numbers of graphs for n<9 with unique 2-connected block.. In this paper, three correlative results are given : 1) The average crossing number of graph with n vertices and q edges can be signified approximately by quadratic equation of q. 2) The average crossing number of graphs with bigger girth is greater than that with smaller girth within given vertices and edges. 3) The average crossing number of r-regular graphs greater than that of non- regular graphs within given vertices and edges where n is odd or r