Ask your own question, for FREE!
Mathematics 18 Online
OpenStudy (anonymous):

Prove that the vertices of G consists of k carbon atoms and m hydrogen atoms then G has a total degree of 4k+m

OpenStudy (anonymous):

@Zarkon can u help me?

OpenStudy (anonymous):

@KingGeorge plleeassseee heeelllpppp me

OpenStudy (anonymous):

. Ok I found a hint in teh back of the book!!!! each carbon atom in G is bonded to four other atoms in G because otherwise an additional hydrogen atom could be bonded to it and this would contradict teh ssumption that G has teh maximum number of hydrogen atoms for its number of carbon atoms. Also each hydrogen atom is bonded to exactly one carbon atom in G because otherwise G would not be connected.

OpenStudy (anonymous):

but i obviously still dont know how to set it up as a proof

OpenStudy (kinggeorge):

So we're assuming some value k for the number of carbon atoms, and assuming that the number of hydrogen atoms is maximal. Would you agree that this is part of the question?

OpenStudy (anonymous):

what does maximal mean?

OpenStudy (anonymous):

well the hydrogen atoms depend on teh carbon atoms

OpenStudy (kinggeorge):

You can use maximal (almost) interchangeably with maximum

OpenStudy (anonymous):

|dw:1340402223423:dw| u know thsi stuff but just in case i drew a diagram of this

OpenStudy (kinggeorge):

I imagine you would prove this using induction on the number of carbon atoms. Give me a minute to see if I get anywhere.

OpenStudy (anonymous):

okkkkkkk thanks:D

OpenStudy (kinggeorge):

This seems too easy.... You know that the total order of the graph is given by the sum of adjacent edges to each carbon atom, added to the sum of adjacent edges to each hydrogen atom. Since each carbon atom has 4 adjacent edges, that's \(4k\). Each hydrogen atom only has one adjacent edge, that's \(1m\). This leaves us with \(4k+m\) as the total order.

OpenStudy (anonymous):

U make everything easyyyyyyyyyy :DDDDDDDD U R AWESOMMMMEEEEEEEE Last nite i tried getting u the position as the king of OS

OpenStudy (kinggeorge):

You're welcome, and thanks for the effort, I appreciate the thought :P

OpenStudy (anonymous):

OMG IT WAS THAT EASYYYYYY hahahahahahah. Thanks kinggeorge that was soooo cleeaarrrr

OpenStudy (kinggeorge):

You're welcome, that was far easier than I thought it would be =D

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!