Discussion
G1 and G2 are two graphs as shown :
Answer: D
G1 has six vertices and nine edges, and its vertices split into two sets, a, d, f and b, c, e, with each vertex of one set joined to every vertex of the other. That is the complete bipartite graph K3,3, which is not planar by Kuratowski's theorem, so G1 is not planar. G2, as the key reads it, can be redrawn without crossing edges, so it is planar; the key is followed for G2. So G1 is not planar and G2 is planar, option (D), and the options calling G1 planar are wrong.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development