|
Abstract
|
A 2-rainbow dominating function (2RDF) on a graph G = (V;E) is a function f fromLet G = (V,E) be a simple graph. A function f : V ! {−1, 1} is called an inverse
signed total dominating function if the sum of its function values over any open neighborhood
is at most zero. The inverse signed total domination number of G, denoted by 0
st(G), equals
to the maximum weight of an inverse signed total dominating function of G. In this paper,
we establish upper bounds on the inverse signed total domination number of graphs in terms
of their order, size and maximum and minimum degrees).
|