Thread: graph theory help

1. graph theory help

suppose that G ~ G bar and that n = |V(G)| = 4k + 1 for k>1. (where G bar is the complement of G)

suppose thta the degree sequence of G is d1>d2>d3>...dn

a) prove that di +dn-i+1 = n-1 for each i= 1,2,3...n

b) use above to prove that G has at least one vertiex with degree (n-1)/2

all the degrees have that as a subscript after them, im just new to the forum so dont really knowhow to make it look mathematically correct. thanks heaps for any help.

2. can anyone please help me with this problem, i really need some help!!

thanks.

3. hah. you must be in my class.

4. Graph Theory at Melbourne Uni?

anyway have you gotten very far on this question?

5. graph theory is gay. I'm totally lost now. i don't even know how to do "induced subgraphs which are paths of length 4" in question 1!!

6. standard melbourne uni maths department... **** and no one can understand a word.

7. i totally agree. waste of time. i should of withdrawn from the subject when i had the opportunity. how is taught is so f*ed? don't you think so? far...