graph theory How many non-isomorfic rooted trees can be created from this tree?

Mathematics
Tutor: None Selected Time limit: 1 Day

A tree is called a rooted tree if one vertex has been designated the root, has indegree of 0 and an outdegree of 1

See picture for an undirected tree.
How many non-isomorfic "rooted trees" can be created from this tree by choosing an appropriate root?

Jul 29th, 2014
The root has to come at the end of one of the branches. So there are nine possible choices of root (see the attachment). That gives you nine possible rooted trees. But some of them are isomorphic. For example, the tree with vertex 2 as its root is isomorphic to the tree with vertex 5 as its root, because you can get from one to the other by twisting those two branches so that they swap positions. Similarly, the trees with roots at 6, 7 and 8 are all isomorphic. Are there any other isomorphisms among these trees? I do not know how to attach the tree but if you inbox me can send it to you there.
Jul 29th, 2014

Studypool's Notebank makes it easy to buy and sell old notes, study guides, reviews, etc.
Click to visit
The Notebank
...
Jul 29th, 2014
...
Jul 29th, 2014
Dec 6th, 2016
check_circle
Mark as Final Answer
check_circle
Unmark as Final Answer
check_circle
Final Answer

Secure Information

Content will be erased after question is completed.

check_circle
Final Answer