326 views

Are the two digraphs shown in the above figure isomorphic? Justify your answer.

edited ago | 326 views

Yes they are isomorphic

They have same number of vertices

They have same number of edges.

They have corresponding vertices with same indegree and outdegree.

$x_5$ and $y_4$ have same degree

The graphs can be redrawn as follows:

selected ago by
+1 vote
since , all conditions like

no if points , no of edges, no of in degree and out degree sequences , no of cycle length all are same still they are necessary and  but not sufficient condition so we cant say at this point

for this if we map each vertex as one to one correspondence of both the graphs then they are isomorphic to each other

i.e. f(x5)=y4  , f(x4)=y5, f(x1)=(y2), f(x2)=y2, f(x3)=y3 , these one to one correspondence is done on the basis of thier no of in degree and no of out degree , since all vertices of both graphs matched so its isomorphic graph

1
2