For an undirected graph $G=(V, E)$, the line graph $G'=(V', E')$ is obtained by replacing each edge in $E$ by a vertex, and adding an edge between two vertices in $V'$ if the corresponding edges in $G$ are incident on the same vertex. Which of the following is TRUE of line graphs?
The line graph of a connected graph is connected. If G is connected, it contains a path connecting any two of its edges, which translates into a path in L(G) containing any two of the vertices of L(G). Therefore, option B is correct.
We can also do this question using elimination of options.
You can view the following google drive link for the example - https://drive.google.com/open?id=0B1OKeqz0MEWwNTh4czgzalVDNGM
3154 Points
1636 Points
1600 Points
1360 Points
1322 Points
1262 Points
1132 Points
1044 Points
900 Points
710 Points
408 Points
262 Points
236 Points
234 Points
138 Points
Gatecse
@sushmita Yes, BITS Pilani is really nice. I ...
yeah, the list will be divided into 3 equal ...