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.
Baskar Babujee, J., & Shanthini, N. (2014). Vertex centered crossing number for maximal planar graph. Iranian Journal of Science, 38(1), 9-17. doi: 10.22099/ijsts.2014.1899
MLA
J. Baskar Babujee; N. Shanthini. "Vertex centered crossing number for maximal planar graph", Iranian Journal of Science, 38, 1, 2014, 9-17. doi: 10.22099/ijsts.2014.1899
HARVARD
Baskar Babujee, J., Shanthini, N. (2014). 'Vertex centered crossing number for maximal planar graph', Iranian Journal of Science, 38(1), pp. 9-17. doi: 10.22099/ijsts.2014.1899
VANCOUVER
Baskar Babujee, J., Shanthini, N. Vertex centered crossing number for maximal planar graph. Iranian Journal of Science, 2014; 38(1): 9-17. doi: 10.22099/ijsts.2014.1899
)