(New page: I do not really have a favorite theorem but one that I like and can remember is '''The Handshake Theorem''' from discrete. I liked it because I understood it and it was a very useful theo...) |
|||
| Line 1: | Line 1: | ||
| − | |||
I do not really have a favorite theorem but one that I like and can remember is '''The Handshake Theorem''' from discrete. I liked it because I understood it and it was a very useful theorem to use in the class. No one else has the same favorite theorem. | I do not really have a favorite theorem but one that I like and can remember is '''The Handshake Theorem''' from discrete. I liked it because I understood it and it was a very useful theorem to use in the class. No one else has the same favorite theorem. | ||
| Line 5: | Line 4: | ||
Let G = (V,E) be an undirected graph with ''e'' edges. Then | Let G = (V,E) be an undirected graph with ''e'' edges. Then | ||
| − | 2''e'' = <math>\sum_{''v''</math> | + | 2''e'' = <math>\sum_{\for all''v''\inV}</math> |
Revision as of 06:11, 31 August 2008
I do not really have a favorite theorem but one that I like and can remember is The Handshake Theorem from discrete. I liked it because I understood it and it was a very useful theorem to use in the class. No one else has the same favorite theorem.
The Handshake Theorem states: Let G = (V,E) be an undirected graph with e edges. Then
2e = $ \sum_{\for all''v''\inV} $
