Hence if G1 and G2 are two arranged graphs with code(G1) = code(G2) then G1 = G2 ... graph G typed over TG an (isomorphic) arranged graph with minimum code.
確定! 回上一頁