Question

Choose the most appropriate definition of plane graph-

• A. A graph drawn in a plane in such a way that any pair of edges meet only at their end vertices
• B. A graph drawn in a plane in such a way that if the vertex set of graph can be partitioned into two non-empty disjoint subsets X and Y in such a way that each edge of G has one end in X and one end in Y.
• C. A simple graph which is isomorphic to a Hamiltonian graph
• D. None of these

Answer 1

The correct option is A A graph drawn in a plane in such a way that any pair of edges meet only at their end vertices

Plane graph is a graph drawn in a plane in such a way that any pair of edges meet only at their end vertices.

A planar graph is a graph that can be embedded in the plane, that is, it can be drawn on the plane in such a way that its edges intersect only at their endpoints. It can be drawn in such a way that no edges cross each other. Such a drawing is called a plane graph. A plane graph can be defined as a planar graph with a mapping from every node to a point on a plane, and from every edge to a plane curve on that plane, such that the extreme points of each curve are the points mapped from its end nodes, and all curves are disjoint except on their extreme points.