Minus total k-subdomination in graphs

Abstract

Let G = (V, E) be a simple graph without isolated vertices. For positive integer k, a 3-valued function f :is the open neighborhood of v. The minus total k-subdomination number γ − kt (G) equals the minimum weight of an MTkSF on G. In this paper, the values on the minus total k-subdomination number of some special graphs are investigated. Several lower bounds on γ − kt of general graphs and trees are obtained.