Total minus domination in k-partite graphs |
| |
| Authors: | Liying Kang |
| |
| Institution: | a Department of Mathematics, Shanghai University, Shanghai 200436, China
b School of Mathematics and Statistics, Curtin University of Technology, GPO BOX U1987, Perth 845, WA, Australia |
| |
| Abstract: | 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  , of G is the minimum weight of a TMDF on G. In this paper, a sharp lower bound on  of k-partite graphs is given. |
| |
| Keywords: | Domination Minus domination Total minus domination k-partite graph |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
