# Maximum Crossing number of topological graph

The crossing number of a graph $G$ is defined as the least number of crossings introduced when $G$ is drawn as a topological graph in the plane.

Is there anything known about the maximum number of crossings which can be introduced by drawing $G$ as a topological graph in the plane?