| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651021 | Discrete Mathematics | 2006 | 5 Pages |
Abstract
A function f defined on the vertices of a graph G=(V,E),f:V→{-1,0,1}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 γt-(G), of G is the minimum weight of a TMDF on G . In this paper, a sharp lower bound on γt- of k-partite graphs is given.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Liying Kang, Erfang Shan, Louis Caccetta,