Unformatted text preview: G = ( V,E ) is nregularfor some positive integer n and ( V 1 ,V 2 ) is a bipartition of V , then  V 1  =  V 2  . That is, show that the two sets in a bipartition of the vertex set of an nregular graph must contain the same number of vertices. 10. State Kuratowski’s Theorem. 11. State the Fundamental Theorem of Arithmetic. 12. Give a de±nition of an inverse of a number a modulo m . 13. Determine the greatest common divisor of 2689 and 4001....
View
Full Document
 Spring '09
 jcliu
 Prime number, Greatest common divisor, positive integer, 7. State Pascal

Click to edit the document details