1 paper
Gang Ma, Jianfeng Wang, Sandi Klavžar
A connected graph G of diameter diam(G)≥ℓ is ℓ-distance-balanced if ∣Wxy∣=∣Wyx∣ for every x,y∈V(G) with dG(x,y)=ℓ, where Wxy is the…