If there are 2 disconnected graphs with m & n nodes respectively and m>n, then Tyranny of Majority states that all the Authorities and Hubs shall be present in graph with m nodes.
This can be viewed as a way of computing disconnected components. Suppose there are 'x' disconnected components, Tyranny of Majority principle is applied to pick the one with all Authorities and Hubs. Once identified, remove this cluster completely from the pool. Now redo the same procedure to find the remaining clusters.
-Rashmi Dubey
