However, different from regular graphs, each arc in A is considered as a hyperarc in the sense that it can capture relations between any two subsets of nodes: a tail (t i ) and a head (h i ).
a hypergraph is a generalization of a regular graph.