Question

What is the minimal NUMBER OF EDGE $10$ which must be removed from a complete BIPARTITE graph of six nodes $k\left(6\right)$ so that the remaining graph is planar?

• A. $2$
• B. $3$
• C. $5$
• D. $6$

Answer 1

The correct option is B $3$

The minimal number of edge 10 which must be removed from a complete BIPARTITE graph of six nodes k (6) so that the remaining graph is planar is 3.

A finite graph is planar if and only if it does not contain a subgraph that is a subdivision of the complete graph K5 or the complete bipartite graph K3,3 (utility graph). A subdivision of a graph results from inserting vertices into edges.

Graph theory is the study of graphs that concerns with the relationship among edges and vertices.