$\ell$-distance-balanced graphs

Stefko Miklavic, Primoz Sparl

Let $\ell$ denote a positive integer. A connected graph $\G$ of diameter at least $\ell$ is said to be $\ell${\it -distance-balanced} whenever for any pair of vertices $u,v$ of $\G…