On the Connectivity of Bipartite Distance-Balanced Graphs

Stefko Miklavic, Primoz Sparl

A connected graph $\G$ is said to be {\it distance-balanced} whenever for any pair of adjacent vertices $u,v$ of $\G$ the number of vertices closer to $u$ than to $v$ is equal to t…