Monge graph

Monge graph --- граф Монжа.

Monge graph is a complete undirected weighted graph [math]\displaystyle{ G = (V,E) }[/math] whose dis\-tan\-ce matrix [math]\displaystyle{ C = (c_{ij}) }[/math] has a property that

[math]\displaystyle{ c_{ij} + c_{k,l} \leq c_{il} + c_{kj} }[/math]

for all [math]\displaystyle{ 1 \leq i \lt k \leq n }[/math], [math]\displaystyle{ 1 \leq j \lt l \leq n }[/math], [math]\displaystyle{ i \neq j }[/math], [math]\displaystyle{ k \neq l }[/math], [math]\displaystyle{ i \neq l }[/math], [math]\displaystyle{ k \neq j }[/math]. [math]\displaystyle{ |V| = n }[/math].