Let $d(v|G)$ be the sum of the dinstances between a vertex $v$ of a graph $G$ and all other vertices of $G$. Let $W (G)$ be the sum of the distances between all pairs of vertices of $G$. A class {\bf C}$(k)$ of bipartite graphs is found, such that $d(v|G)\equiv 1\pmod k$ holds for an arbitrary vertex of an arbitrary member of {\bf C}$(k)$. Further, for two members $G$ and $H$ of {\bf C}$(k)$, having equal cyclomatic number, $W(G)\equiv W(H)\pmod{2k^2}$.