Before revision: Strong union states that Transitivity states that Graphoid axioms constitute a complete characterization of undirected graphs.A.
After revision: Strong union states that Transitivity states that The graphoid axioms symmetry, decomposition, intersection, strong union and transitivity constitute a complete characterization of undirected graphs.A.