Opinion functions on trees (Q1356450): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(96)00221-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1987768067 / rank | |||
Normal rank | |||
Latest revision as of 10:23, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Opinion functions on trees |
scientific article |
Statements
Opinion functions on trees (English)
0 references
16 March 1998
0 references
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.
0 references
opinion function
0 references
tree
0 references
