Reverse Total Signed Vertex Domination in Graphs

• 作者: Wensheng Li
• 来源期刊: 离散数学期刊(英文)
• 学科: 数学
• 关键词: REVERSE TOTAL SIGNED VERTEX DOMINATION Upper Bounds Complete BIPARTITE Graph
• 年，卷（期）: 2013,（1）
• 页码范围: 53-55
• 页数: 3页
• 分类号: O1

摘要

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.