In graph theory, the Edmonds matrix A{\displaystyle A} of a balanced bipartite graph G(U,V,E){\displaystyle G(U,V,E)} with sets of vertices U={u1,u2,…,un}{\displaystyle U=\{u_{1},u_{2},\dots ,u_{n}\}} and V={v1,v2,…,vn}{\displaystyle V=\{v_{1},v_{2},\dots ,v_{n}\}} is defined by
