1.

A graph is ______ if and only if it does not contain a subgraph homeomorphic to k5 or k3,3.(a) bipartite graph(b) planar graph(c) line graph(d) euler subgraphThe question was asked in quiz.My query is from Isomorphism in Graphs in division Graphs of Discrete Mathematics

Answer»

The correct OPTION is (b) planar GRAPH

To EXPLAIN I WOULD say: A graph is known as planar graph if and only if it does not CONTAIN a subgraph homeomorphic to k5 or k3,3.



Discussion

No Comment Found

Related InterviewSolutions