For each of the trees, how many different ways are there of coloring the
vertices with k colors such that adjacent vertices are colored with different colors and so that two colorings of the graph are considered different if there is no rearrangement of the vertices so that they look the same?
i dont understand the last bit
Best Answer
For example in the first graph the coloring:
$A\\B-C\\D\\E-F\\G$
is "the same" that the coloring:
$G\\E-F\\D\\B-C\\A$