Distance-Balanced Graphs

Janja Jerebic, Sandi Klavžar, Douglas F. Rall
2008 Annals of Combinatorics  
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. The new concept is connected with symmetry conditions in graphs and local operations on graphs are studied with respect to it. Distance-balanced Cartesian and lexicographic products of graphs are also characterized. Several open problems are posed along the way.
doi:10.1007/s00026-008-0337-2 fatcat:7fetqyem2ff3flzg3qekurf4tu