“…A hypergraph where the hyperedges are distinct one-to-one is said with no repeated hyperedge. In [7], a hypergraph is a triple H = (V, E, i) with V a vertex set, E a hyperedge set and i : E → P (V ) 4 an incidence function. Considering a map w : E → R ++ the hypergraph H w = (V, E, w) -or H w = (V, E, i, w) -is said weighted.…”