1. Balakrishnan, K., Brešar, B., Changat, M., Klavžar, S., Vesel, A., Žigert Pleteršek, P.: Equal opportunity networks, distance-balanced graphs, and Wiener game. Discret. Optim. 12, 150–1154 (2014)
2. Balakrishnan, K., Changat, M., Peterin, I., Špacapan, S., Šparl, P., Subhamathi, A.R.: Strongly distance-balanced graphs and graph products. Eur. J. Combin. 30, 1048–1053 (2009)
3. Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance-Regular Graphs. Springer, New York (1998)
4. Cabello, S., Lukšič, P.: The complexity of obtaining a distance-balanced graph. Electron. J. Combin. 18, 10 (2011). (paper 49)
5. Cavaleri, M., Donno, A.: Distance balanced graphs and travelling salesman problems. arXiv:1905.03165v1 [math.CO]