Resistance distance local rules

In D.J. Klein, Croat. Chem. Acta. 75(2), 633 (2002)] Klein established a number of sum rules to compute the resistance distance of an arbitrary graph, especially he gave a specific set of local sum rules that determined all resistance distances of a graph (saying the set of local sum rules is complete). Inspired by this result, we give another complete set of local rules, which is simple and also efficient, especially for distance-regular graphs. Finally some applications to chemical graphs (for example the Platonic solids as well as their vertex truncations, which include the graph of Buckminsterfullerene and the graph of boron nitride hetero-fullerenoid B ₁₂ N ₁₂) are made to illustrate our approach.