Opinion functions on trees (Q1356450): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Peter Kirschenhofer / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Peter Kirschenhofer / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Majority domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3158579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4374706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minus domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4378623 / rank
 
Normal rank
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
    0 references
    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
    0 references
    0 references
    0 references
    0 references

    Identifiers