On the domination of hypergraphs by thei
β
A. Behr; L. Camarinopoulos
π
Article
π
1998
π
Elsevier Science
π
English
β 395 KB
Given a hypergraph 9f=(E1,...,Er,) with vertex set V, let no be the number of different possibilities for coveting V by an odd number of E's and n~ the number of different possibilities for covering V when selecting an even number of E's. The quantity d(V, o~f)= no-nΒ’ is known as the (reliability) d