When adjacency data is extracted from a hypergraph, it is arranged by symmetry type and order. For a given type and order, we get a N x N x ... x N array. We must define a hypermatrix data structure so that adjacency hypermatrix addition corresponds exactly to hypergraph additive union.
When adjacency data is extracted from a hypergraph, it is arranged by symmetry type and order. For a given type and order, we get a N x N x ... x N array. We must define a hypermatrix data structure so that adjacency hypermatrix addition corresponds exactly to hypergraph additive union.