Resistance distance in complete nn-partite graphs

We may view any graph as a network of resistors each having a resistance of 1 Ω. The resistance distance   between a pair of vertices in a graph is defined as the effective resistance between the two vertices. This function is known to be a metric on the vertex-set of any graph. The main result of this paper is an explicit expression for the resistance distance between any pair of vertices in the complete nn-partite graph Km1,m2,…,mnKm1,m2,…,mn.