Graph theory line graph proof

  • #1
dancergirlie
200
0

Homework Statement


Let G be a non-empty graph of order n whose vertices have degrees d1, . . . , dn.
The line graph of G is defined as follows: the vertices of L(G) are the edges of G, and two vertices of L(G) are adjacent if they share an endpoint in G. Prove that the size of L(G) is:

[tex]\sum(di choose 2)[/tex] from i=1 to n

Hint: The size of Kd is (d choose 2)


Homework Equations





The Attempt at a Solution



Well I know that the SUM(deg v)=2|E|
meaning that |E| or the size of G is (1/2)SUM(di)
Which would mean that the order of L(G) would be (1/2)SUM(di)

I think that the line graph is a complete graph would would mean that would mean that the degree of each vertex would be (n-1), and in the case of the line graph would be ((1/2)SUM(di))-1

I don't really know if I'm on the right track, any help would be greatly appreciated!
 

Answers and Replies

Suggested for: Graph theory line graph proof

  • Last Post
Replies
7
Views
423
  • Last Post
Replies
2
Views
304
  • Last Post
Replies
6
Views
379
  • Last Post
Replies
3
Views
344
  • Last Post
Replies
10
Views
352
Replies
6
Views
438
Replies
17
Views
419
Replies
7
Views
520
Top