Signed Total Domination Nnumber of a Graph


    loading  Checking for direct PDF access through Ovid

Abstract

The signed total domination number of a graph is a certain variant of the domination number. If v is a vertex of a graph G, then N(v) is its oper neighbourhood, i.e. the set of all vertices adjacent to v in G. A mapping f: V(G) → {−1, 1}, where V(G) is the vertex set of G, is called a signed total dominating function (STDF) on G, if ∑ x∈(v). 1 for each vV (G). The minimum of values ∑ x∈(v)f(x), taken over all STDF's of G, is called the signed total domination number of G and denoted by γst(G). A theorem stating lower bounds for γst(G) is stated for the case of regular graphs. The values of this number are found for complete graphs, circuits, complete bipartite graphs and graphs on n-side prisms. At the end it is proved that γst(G) is not bounded from below in general.

    loading  Loading Related Articles