%0 Journal Article
%T Note on edge distance-balanced graphs
%A M. Tavakoli
%A H. Yousefi-Azari
%A Alireza Ashrafi
%J Transactions on Combinatorics
%D 2012
%I University of Isfahan
%X 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.
%K Edge distance-balanced
%K vertex distance-balanced
%K graph operation
%U http://www.combinatorics.ir/?_action=showPDF&article=86&_ob=41c9776f55f12410740dfdfe4fa080ec&fileName=full_text.pdf