Note on edge distance-balanced graphs

Abstract

Edge distance-balanced graphs are graphs in which for every edge $e = uv$ the number of edges closer to vertex $u$ than to vertex $v$ is equal to the number of edges closer to $v$ than to $u$. In this paper, we study this property under some graph operations.