{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# quiz3-review - 1 Hint what equation do you get if you set x...

This preview shows pages 1–2. Sign up to view the full content.

CS 173: Discrete Structures, Spring 2010 Quiz 3 review These problems should not be turned in. They are to help you review for the third quiz. 1. Relation properties A B C D Reflexive : Irreflexive : Symmetric : Antisymmetric : Transitive : is the relation on R such that x y if and only if xy = 1 Reflexive : Irreflexive : Symmetric : Antisymmetric : Transitive : A B C D E Reflexive : Irreflexive : Symmetric : Antisymmetric : Transitive : 1

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2. Equivalence classes Let A = R + × R + - { (0 , 0) } , i.e. pairs of positive reals in which no more than one of the two numbers is zero. Consider the equivalence relation on A defined by ( x,y ) ( p,q ) iff ( xy )( p + q ) = ( pq )( x + y ) (a) List four elements of [(3
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: , 1)]. Hint: what equation do you get if you set ( x, y ) to (3 , 1) and q = 2 p ? (b) Give two other distinct equivalence classes that are not equal to [(3 , 1)]. (c) Describe the members of [(0 , 4)]. 3. Graph isomorphism (a) Prove that the following two graphs are isomorphic. That is, for each vertex in G 1, give the corresponding vertex in G 2, making sure your mapping preserves the edge structure. G1: A B C D E G2: 1 5 3 4 2 (b) Prove that the following two graphs are not isomorphic. G1: A B C D E G2: 1 2 3 4 5 2...
View Full Document

{[ snackBarMessage ]}

### Page1 / 2

quiz3-review - 1 Hint what equation do you get if you set x...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online