A complete n-node graph Kn is planar if and only if                            

Related MCQs

• A graph is planar if and only if it does not contain ________.
• What is the grade of a planar graph consisting of 8 vertices and 15 edges?
• If G is a connected planar graph then it has a vertex of degree _______.
• G is a simple undirected graph and some vertices of G are of odd degree. Add a node n to G and make it adjacent to each odd degree vertex of G. The resultant graph is              
• Let G be an arbitrary graph with v nodes and k components. If a vertex is removed from G, the number of components in the resultant graph must necessarily lie down between            and            
• In a graph if few edges have directions and few do not have directions then the graph is called _________.
• Berge graph is similar to              due to strong perfect graph theorem.
• A path of a graph is said to be ______ if it contains all the edges of the graph.
• The total number of edges in a complete graph of n vertices is _________.
• A directed complete graph of n vertices contains __________.