First time here? Checkout the FAQ!
+3 votes

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?

  1. the line graph for a complete graph is complete
  2. the line graph for a connected graph is connected
  3. the line graph for a bipartite graph is bipartite 
  4. the maximum degree of any vertex in the line graph is at most the maximum degree in the original graph
  5. each vertex in the line graph has degree one or two
asked in Graph Theory by Veteran (77.8k points)   | 137 views
Option B). is true.
yes, Agreed. (y)
why not option C?
you can check with K(2,2). The line graph obtained is not biparitite.

1 Answer

+1 vote

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 -

answered by Active (1k points)  
edited by
but your L(G2): e1---e2 it is bipertite right?e1 may be in one partition and e2 on is bipertite i guess.

I have corrected the example, and updated the file.
great example you have updated...proving line of tree is not a tree too :p

Top Users Jun 2017
  1. Bikram

    3704 Points

  2. Arnab Bhadra

    1502 Points

  3. Hemant Parihar

    1502 Points

  4. Niraj Singh 2

    1481 Points

  5. junaid ahmad

    1432 Points

  6. Debashish Deka

    1402 Points

  7. Rupendra Choudhary

    1230 Points

  8. rahul sharma 5

    1222 Points

  9. Arjun

    1168 Points

  10. pawan kumarln

    1164 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 Jun 26 - Jul 02
  1. pawan kumarln

    296 Points

  2. akankshadewangan24

    214 Points

  3. Arjun

    208 Points

  4. Debashish Deka

    156 Points

  5. Hira Thakur

    130 Points

23,414 questions
30,125 answers
28,443 users