Question: (e) For two rooted trees to be isomorphic under a permutation, the image (r) of a root r must also be a root. Draw

(e) For two rooted trees to be isomorphic under a permutation, the

(e) For two rooted trees to be isomorphic under a permutation, the image (r) of a root r must also be a root. Draw (clearly!) a list of rooted trees on 5 vertices such that every rooted tree on 5 vertices is isomorphic to exactly one in your list. Draw the roots as solid black circles and the rest of the vertices as hollow circles. Two such trees are already shown below and you do not need to re-draw them in your answers. [5 marks]

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

To understand this question you need to first understand isomorphism in trees ISO... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Algorithms Questions!