It turns out that for every matrix M rank M rank MT Use th

It turns out that for every matrix M, rank M = rank M^T . Use this fact to express the minimum number of edges needed to remove all unoriented loops in a network G in terms of the number v of vertices in G, number e of edges in G, and number c of connected components of G.

Solution

rank M = rank MT