The family of D-weights for a two-rooted graph

Let Π(G) be the set of paths of a particular class Π from the initial to the terminal root of a two-rooted (possibly directed) graph G. We consider the family of $\text{D}$-weights defined by

where Π_x(G) is the family of subsets of Π(G) which cover x(G), the vertex set or the edge (arc) set of G.A number of the common properties and interrelations of these weights are discussed. Some of the weights have been considered previously, [1, 2], in the context of percolation theory but here only combinatorial arguments are used.