Vertex centered crossing number for maximal planar graph
Author(s):
Abstract:
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.
Keywords:
Language:
English
Published:
Iranian Journal of science and Technology (A: Siences), Volume:38 Issue: 1, Winter 2014
Pages:
9 to 17
https://magiran.com/p1243264