On virtual pathwidth of virtual graphs of a virtual link

The geometric representation of a knot is not too dissimilar from a graph and this interaction has helped mathematicians to solve many problems. In this paper, we apply graph theory tools to study the classification of virtual knots and links. We define virtual planar graphs and compute virtual path width of an associated graph of a virtual link. We show that the virtual path width of an associated graph is equal to the virtual bridge number of a pseudo prime knot.