Vertex centered crossing number for maximal planar graph

Document Type: Regular Paper


Department of Mathematics, Anna University, Chennai, 600 025, India


The crossing number of a graph  is the minimum number of edge crossings over all possible drawings of  in a plane. The crossing number is an important measure of the non-planarity of a graph, with applications in discrete and computational geometry and VLSI circuit design. In this paper we introduce vertex centered crossing number and study the same for maximal planar graph.