(e) For two rooted trees to be isomorphic under a permutation, the image (r) of a...

Transcribed Image Text:

(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] (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]

Answer rating: 100% (QA)

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