Let G be the following directed graph.

Let V be the set of vertices in G and let E be the set of edges in G. This graph describes a function
i : E → V × V
where
i(e) = (a, b)
if edge e goes from vertex a to vertex b.

List the values of
i(e1), i(e2), ... , i(e8).

i(e1) (a, b) =

i(e2) (a, b) =

i(e3) (a, b) =

i(e4) (a, b) =

i(e5) (a, b) =

i(e6) (a, b) =

i(e7) (a, b) =

i(e8) (a, b) =

Question

Let G be the following directed graph.

Let V be the set of vertices in G and let E be the set of edges in G. This graph describes a function
i : E → V × V
where 
i(e) = (a, b)
 if edge e goes from vertex a to vertex b.

List the values of 
i(e1), i(e2), ... , i(e8).

i(e1)	    	(a, b)	 = 	

   

     
i(e2)	    	(a, b)	 = 	

   

     
i(e3)	    	(a, b)	 = 	

   

     
i(e4)	    	(a, b)	 = 	

   

     
i(e5)	    	(a, b)	 = 	

   

     
i(e6)	    	(a, b)	 = 	

   

     
i(e7)	    	(a, b)	 = 	

   

     
i(e8)	    	(a, b)	 =

anonymous · Answer

attachment

zzr0ck3r · Answer

sorry I don't think I can help with this one

anonymous · Answer

no worries, I will work on this one later