A characterisation of universal minimal total dominating functions in trees (Q1894760): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Universal minimal total dominating functions in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Total dominating functions in trees: Minimality and convexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Universal minimal total dominating functions of trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convexity of minimal total dominating functions in graphs / rank | |||
Normal rank |
Latest revision as of 15:54, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A characterisation of universal minimal total dominating functions in trees |
scientific article |
Statements
A characterisation of universal minimal total dominating functions in trees (English)
0 references
24 July 1995
0 references
A total dominating function (TDF) of a graph \(G= (V, E)\) is a mapping \(f\) of \(V\) into the closed interval \([0, 1]\) of real numbers with the property that for each \(v\in V\) the sum of values of \(f\) in all vertices adjacent to \(v\) is at least 1. A TDF is called minimal (MTDF), if there exists no TDF \(g\) of \(G\) with the property that \(g(x)\leq f(x)\) for all \(x\in V\) and \(g(x_ 0)< f(x_ 0)\) at least for one \(x_ 0\in V\). A convex combination of two functions \(f\), \(g\) is a function \(h_ \lambda\) given by \(h_ \lambda(x)= \lambda f(x)+ (1- \lambda) g(x)\), where \(\lambda\) is a real number from the interval \([0,1]\). If a MTDF has the property that its convex combination with any other MTDF is also a MTDF, it is called a universal MTDF. In the paper the universal minimal total dominating functions of trees are characterized.
0 references
characterization
0 references
minimal total dominating functions
0 references
total dominating function
0 references
TDF
0 references
convex combination of two functions
0 references
universal minimal total dominating functions
0 references
trees
0 references