Search
Now showing items 1-2 of 2
The Uniformity Space of Hypergraphs
(2012-08-14)
For a hypergraph H=(V,E) and a field F, a weighting of H is a map f:V ?F. A weighting is called stable if there is some k ? F such that the sum of the weights on each edge of H is equal to k. The set of all stable weightings ...
On Connectedness and Graph Polynomials
(2016-04-08)
Given a graph G whose nodes are perfectly reliable and whose edges fail independently
with probability q in [0,1], the all-terminal reliability of G is the probability that all
vertices of G can communicate with one ...