Let F be aSimple Graphwith n 2 vertices.

Proove that F contains at least two vertices of the same degree.

well i know that A graph is called simple if there is at most one edge between any two points.

Printable View

- December 7th 2009, 09:32 PMAwesomeDesiKidGraph Theory with Prooving
Let F be a

__Simple Graph__with n 2 vertices.

Proove that F contains at least two vertices of the same degree.

well i know that A graph is called simple if there is at most one edge between any two points. - December 7th 2009, 11:12 PMNonCommAlg
- December 7th 2009, 11:21 PMAwesomeDesiKid
- December 7th 2009, 11:34 PMNonCommAlg
- December 7th 2009, 11:36 PMAwesomeDesiKid