Opinion functions on trees
type: Item
instance of: scholarly article
title: Opinion functions on trees
zbMATH Open document ID: 0883.05039
DOI: 10.1016/S0012-365X(96)00221-X
author: L. W. Beineke
author: Michael A. Henning
published in: Discrete Mathematics
publication date: 1998-03-16T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 1018507
zbMATH Keywords: opinion function
zbMATH Keywords: tree
reviewed by: Peter Kirschenhofer
MaRDI profile type: Publication
cites work: Majority domination in graphs
cites work: Q3158579
cites work: Q4374706
cites work: Minus domination in graphs
cites work: Q4871151
cites work: Q4378623
full work available at URL: s0012-365x(96)00221-x
OpenAlex ID: W1987768067
description: scientific article; zbMATH DE number 1018507