摘要

A function f : V (G) -> {-1, 1} defined on the vertices of a graph G = (V, E) is a signed total 2-independence function if for each vertex v is an element of V(C) the sum of function values over its open neighborhood is at most one. The signed total 2-independence number of a graph C, denoted by alpha(2)(st)(G), is the maximum weight of a signed total 2-independence function of G. In this paper, we establish some bounds on the signed total 2-independence number for general graphs and K(r+1)-free graphs. Some of our results improve or generalize previous results on the signed total 2-independence number.