Isomorphy between graphs

75 Views Asked by At

I am asked to find a undirected graph that is Isomorphic to a directed graph. Does that even make sense? directed graph with 3 nodes My first thought was a cycle with 3 Vertices, but I don't feel this should be the solution since 2 Isomorphic graphs have the same amount of edges. But with undirected graph we also have the "advantage" that the edges can be read for ex {a,b}={b,a}. Thanks in Advance