Question

Draw the directed graph that represents the relation {(a,a), (a, b), (b, c), (c, d), (a, d), (b, d), (d, b)}.

Answer 1

Let G = (V, E) be a directed graph that represents the given relation R, then there is $e\isin E$ that connects verticles $v_1,v_2\in V$ if and only if pair $(v_1,v_2)\subset R$. This graph is presented below