This is a small interesting finding in my M.A. thesis. I dont know if it is useful in practice.
Given a set of nodes Z, and cost function C: ZxZ->R,
there exists some node, say i, such that for all proper subset S contains i,
max k∈Z\S,Z∈S {cik-ckz}≥ 0.
For example, let Z={1,2,3}, and c12=1,c13=4,c21=5,c23=1,c31=3,c32=2.
We can find that only node 3 satisfies maxk∈Z\S,Z∈S{c3k-ckz}≥ 0,
e.g. S={2,3}, Z\S={1}. We have c31-c12≥ 0