GATE CSE
First time here? Checkout the FAQ!
x
+3 votes
133 views

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.2k points)   | 133 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 - https://drive.google.com/open?id=0B1OKeqz0MEWwNTh4czgzalVDNGM

answered by Junior (995 points)  
edited by
but your L(G2): e1---e2 it is bipertite right?e1 may be in one partition and e2 on another...it is bipertite i guess.
Hi,

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 May 2017
  1. akash.dinkar12

    3154 Points

  2. pawan kumarln

    1636 Points

  3. sh!va

    1600 Points

  4. Arjun

    1360 Points

  5. Bikram

    1322 Points

  6. Devshree Dubey

    1262 Points

  7. Debashish Deka

    1132 Points

  8. Angkit

    1044 Points

  9. LeenSharma

    900 Points

  10. srestha

    710 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 May 22 - 28
  1. Bikram

    408 Points

  2. pawan kumarln

    262 Points

  3. Ahwan

    236 Points

  4. Arnab Bhadra

    234 Points

  5. LeenSharma

    138 Points


22,772 questions
29,098 answers
65,132 comments
27,639 users