# a doubt over a term in paper of graph theory

I was reading a paper http://www.sciencedirect.com/science/article/pii/S0166218X08001960.

On the page 38, under the topic The vertex hierarchy I have doubt. From where did the following term come?

I am getting no idea how they did it? Any hint will be appreciated. Thanks a lot for help.

-
You want to count vertices that has zeros at coordinates $< k$ and are non-zero at exactly $k$-th coordinate and anything at bigger coordinates. Hence, you have exactly $1$ possibility for $i < k$ (namely, zero), $n_i - 1$ possibilities for $i = k$ (anything but a zero) and $n_i$ possibilities for $i > k$ (no constraints). Multiplying it all will get you the aforementioned formula. –  dtldarek Aug 22 '13 at 10:38
thanks a lot :) I got it. –  monalisa Aug 22 '13 at 10:42