Our definition of a triangle t = {e1,e2,e3} for an undirected signed graph G = (V,E,x) expresses each triangle as an unordered set of edges. However, we implicitly impose an ordering on the edges of t when we form xt = (xe1 ,xe2 ,xe3) because the vector xt is an ordered object. As this ordering is arbitrary, d : {0,1}3→ R+ must be invariant to the order of… (More)