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

90 ways to properly color for first node 10 choices and for second 9 choices.

---

can you please explain a bit

---

only 2 colours are sufficient to color any tree...

C(10,2) = 45

but colouring is permutation but not combination P(10,2) = 90.

---

I think question is incomplete too

if it has only 2 vertices?

---

in that case also it have 90 ways..

but it fail for G have only one vertex

---

yes but question directly not telling , ho ay vertices in the graph

So, question is incomplete I think

---

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