1
$\begingroup$

MacArthur, Sanchez-Garcia, and Anderson have used the ratio of the order of $|Aut(G)|$ and $n!$ (i.e., order of $S_n$) as a normalized measure of the symmetries present in a graph.

I am working on a project where the symmetries of rooted trees are important, and am trying to calculate the analogue of $|S_n|$ -- i.e., the order of the largest possible automorphism group on a rooted tree with $n$ vertices. I am a relative beginner to algebraic graph theory and after some time spent attempting to find the answer in the literature, I am hoping someone can provide a timely pointer.

Thank you!

$\endgroup$

1 Answer 1

5
$\begingroup$

The corollas (rooted trees of height one) are clearly the most symmetric rooted trees. The automorphism group of the corolla with n vertices (one root and $n-1$ leaves ) is the symmetric group $S_{n-1}$.

$\endgroup$
0

You must log in to answer this question.