Distance-balanced graphs and Travelling Salesman Problems

Matteo Cavaleri, Alfredo Donno

For every probability $p\in [0,1]$ we define a distance-based graph property, the $p$TS-distance-balancedness, that in the case $p=0$ coincides with the standard distance-balancedne…