On total vertex-edge domination

Abstract

In this paper we obtain an improved upper bound of total vertex edgedomination number of a tree. If T is a connected tree with order n, then ????(T) ? m/3 with m = 6[ n/6] and we characterize the trees attaining this upper bound. Furthermore we provide a characterization of trees T with ????(T) = ?? (T).