graph theory

Question

10.A graph G has any two vertices connected by exactly one path. Find the
Number of ways we can properly colour G it we are provided with 10
colours.

Comments

no,I have written complete question

---

i hope, they initially mention it, and more questions on that information.

but who upload this image, just he/she kept a question which is his/her doubt.

---

here is the full question,please check