In this paper we propose and study a new structural invariant for graphs, called distance-unbalancedness, as measure of how much graph is (un)balanced in terms distances. Explicit formulas are presented several classes well-known graphs. Distance-unbalancedness trees also studied. A few conjectures stated some open problems proposed.
