[Question] Formula for number of parameters in an undirected graphical model

Disclaimer: crossposted here.

I have googled endlessly, and I cannot find it. Can anyone point me to a reference that gives a way to calculate the number of parameters in an undirected Graphical Model?

Adapting from the similar formula for Bayes nets, this is my guess: if we have variables $1 \ldots k$ where variable $i$ has $d_i$ possible values, and $n(i)$ is the set of vertices adjacent to $i$ in the independence graph, then the number of parameters would be

$\Sigma{i=1}^{k}(d_i - 1) \Pi{j \in n(i)}d_j$.

Can anyone verify this, and if it's wrong, point me to a correct solution?

I'm trying to calculate the AIC and BIC scores for graphical models, but to do that, I need the number of parameters each has.