Title of article
Total minus domination in k-partite graphs
Author/Authors
Liying Kang، نويسنده , , Erfang Shan، نويسنده , , Louis Caccetta، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
5
From page
1771
To page
1775
Abstract
A function f defined on the vertices of a graph image 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 image, of G is the minimum weight of a TMDF on G. In this paper, a sharp lower bound on image of k-partite graphs is given.
Keywords
Domination , Minus domination , Total minus domination , k-partite graph
Journal title
Discrete Mathematics
Serial Year
2006
Journal title
Discrete Mathematics
Record number
948020
Link To Document