Before revision:  Those dual and parallel criteria are perfectly suited for graphs clustering, this will be illustrated and shown on various types of graphs within this paper .
After revision:  Eventually we estimate the average difference between both couplings as the key explanation of their usually close results in network clustering .