TITLE:
Reverse Total Signed Vertex Domination in Graphs
AUTHORS:
Wensheng Li
KEYWORDS:
Reverse Total Signed Vertex Domination; Upper Bounds; Complete Bipartite Graph
JOURNAL NAME:
Open Journal of Discrete Mathematics,
Vol.3 No.1,
January
29,
2013
ABSTRACT: Let be a simple graph with vertex set V and edge set E. A function is said to be a reverse total signed vertex dominating function if for every , the sum of function values over v and the elements incident to v is less than zero. In this paper, we present some upper bounds of reverse total signed vertex domination number of a graph and the exact values of reverse total signed vertex domination number of circles, paths and stars are given.