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

Question Description

I don’t understand this Mathematics question and need help to study.

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?

Student has agreed that all tutoring, explanations, and answers provided by the tutor will be used to help in the learning process and in accordance with Studypool's honor code & terms of service.

Final Answer

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.

Ashley_R (1174)
UT Austin

Top quality work from this tutor! I’ll be back!

Just what I needed… fantastic!

Use Studypool every time I am stuck with an assignment I need guidance.


Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors