Total minus domination in k-partite graphs

被引：9
|
作者：
Kang, Liying [1 ]
Shan, Erfang
Caccetta, Louis
机构：
[1] Shanghai Univ, Dept Math, Shanghai 200436, Peoples R China
[2] Curtin Univ Technol, Sch Math & Stat, Perth, WA 845, Australia
来源：
DISCRETE MATHEMATICS | 2006年 / 306卷 / 15期
基金：
中国国家自然科学基金;
关键词：
domination; minus domination; total minus domination; k-partite graph;
D O I：
10.1016/j.disc.2006.03.004
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A function f defined on the vertices of a graph G = (V, E), f : V -> {-1, 0, 1} is a total minus dominating function (TMDF) if the sum of its values over any open neighborhood is at least one. The weight of a TMDF is the sum of its function values over all vertices. The total minus domination number, denoted by gamma(-)(t) (G), of G is the minimum weight of a TMDF on G. In this paper, a sharp lower bound on gamma(-)(t) of k-partite graphs is given. (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码：1771 / 1775
页数：5
相关论文
共 50 条
12345