GATEverse
← GATE CSE 2013

Q26

MCQ2 marks, −0.67

The line graph L(G)L(G) of a simple graph GG is defined as follows: There is exactly one vertex v(e)v(e) in L(G)L(G) for each edge ee in GG. For any two edges ee and e′e' in GG, L(G)L(G) has an edge between v(e)v(e) and v(e′)v(e'), if and only if ee and e′e' are incident with the same vertex in GG. Which of the following statements is/are TRUE? (P) The line graph of a cycle is a cycle. (Q) The line graph of a clique is a clique. (R) The line graph of a planar graph is planar. (S) The line graph of a tree is a tree.

Sign in to save attempts.

Loading…