There exist some Drawing for any graph G = (V,E) on plan. An important aim in Graph Theory and Computer science is obtained a best drawing of an arbitrary graph. Also, a draw of a non-planar graph G on plan generate several edge-cross. A good drawing (or strongly best drawing) of G is consist of minimum edge-cross. The crossing number of a graph G, is the minimum number of crossings in a drawin...