This preview shows page 1. Sign up to view the full content.
Unformatted text preview: A = { a 1 ,a 2 ,a 3 ,a 4 } and R = { ( a 1 ,a 2 ) , ( a 2 ,a 1 ) , ( a 3 ,a 2 ) , ( a 3 ,a 3 ) } . The directed graph of this relation is A a 1 a 2 a 3 a 4 Notice that the direction of the arrows matters. It is, of course, still possible to use a diagram where the source and target sets are drawn separately as in 1. You should also remember this formulation. [Again, we sometimes omit the boundary circle.] Directed graphs will be studied further in Discrete Maths 2. 16...
View
Full
Document
This note was uploaded on 01/02/2010 for the course MATH Math2009 taught by Professor Koskesh during the Spring '09 term at SUNY Empire State.
 Spring '09
 Koskesh
 Math

Click to edit the document details