On signed majority total domination in graphs期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

On signed majority total domination in graphs

Authors:	Hua-Ming Xing Liang Sun Xue-Gang Chen

Affiliation:	(1) Dept. of Mathematics, Langfang Teachers College, Langfang, Hebei, 065000, P.R. China;(2) Dept. of Mathematics, Beijing Institute of Technology, Beijing, 100081, P.R. China;(3) The College of Info. Sci. and Eng., Shandong University of Sci. and Tech., Taian, 271019, P.R. China

Abstract:	We initiate the study of signed majority total domination in graphs. Let G = (V, E) be a simple graph. For any real valued function f: V and SV, let $f(S) = sumlimits_{v in S} {;f(v)}$ . A signed majority total dominating function is a function f: V {–1, 1} such that f(N(v)) 1 for at least a half of the vertices v V. The signed majority total domination number of a graph G is $gamma _{maj}^t (G)$ = min{f(V): f is a signed majority total dominating function on G}. We research some properties of the signed majority total domination number of a graph G and obtain a few lower bounds of $gamma _{maj}^t (G)$ .This research was supported by National Natural Science Foundation of China.

Keywords:	signed majority total dominating function signed majority total domination number
本文献已被 SpringerLink 等数据库收录！