Data Structure - Programming Language (MCQ) questions for Q. 590

Q.  Data Structure: K4 and K3 are graphs with the following structure.



Which one of the following statements is TRUE in relation to these graphs?
- Published on 19 Oct 15

a. K4 is planar while Q3 is not
b. Q3 is planar while K4 is not
c. Both K4 and Q3 are planar
d. Neither K4 nor Q3 is planar

ANSWER: Both K4 and Q3 are planar

Related Content

 

    Discussion

  • Nihal   -Posted on 01 Apr 16
    Both K4 and Q3 are planar graph.

    The given graph can be drawn as follows:
    Graph K3

    Graph K4

    A graph G is called planar if it can be drawn in the plane in such a way that no two edges intersect with each other.

    Euler's Formula = Let 'G' be a connected planar graph, and let 'n' is the numbers of vertices, 'e' is the number of edges and 'f' denote faces then n - m + f = 2.

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲