Inverse signed total domination numbers of some kinds of graphs

Abstract

Let G=(V,E) be a simple graph. A function 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 for a graph equals to the maximum weight of an inverse signed total dominating function of G. In this paper, exact values are found for paths, cycles, complete graphs, stars and wheels. © 2012 Springer-Verlag.