Opinion functions on trees
An opinion function \(f\) on a graph \(G= (V,E)\) is a function \(f:V\to\{-1,1\}\). The number of vertices \(v\) with \(f(v)=1\) is called the positive value of \(f\). \(\text{Vote}(v)\) is the sum of the values \(f(w)\) over all \(w\) in the closed neighborhood of \(v\). A number of results on these parameters is shown for \(G\) being a tree.
scientific article; zbMATH DE number 1018507