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

Anonymous
timer Asked: Jul 29th, 2014
account_balance_wallet $5

Question Description

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?

Tutor Answer

Khali R
School: UT Austin

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.

flag Report DMCA
Review

Anonymous
Goes above and beyond expectations !

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