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. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.
TAVAKOLI, M., & YOUSEFI-AZARI, H. (2011). Remarks on Distance-Balanced Graphs. Iranian Journal of Mathematical Chemistry, 2(2), 67-71. doi: 10.22052/ijmc.2011.5176
MLA
M. TAVAKOLI; H. YOUSEFI-AZARI. "Remarks on Distance-Balanced Graphs", Iranian Journal of Mathematical Chemistry, 2, 2, 2011, 67-71. doi: 10.22052/ijmc.2011.5176
HARVARD
TAVAKOLI, M., YOUSEFI-AZARI, H. (2011). 'Remarks on Distance-Balanced Graphs', Iranian Journal of Mathematical Chemistry, 2(2), pp. 67-71. doi: 10.22052/ijmc.2011.5176
VANCOUVER
TAVAKOLI, M., YOUSEFI-AZARI, H. Remarks on Distance-Balanced Graphs. Iranian Journal of Mathematical Chemistry, 2011; 2(2): 67-71. doi: 10.22052/ijmc.2011.5176
)