ON TOTAL VERTEX-EDGE DOMINATION

Özet

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 ve(T) ≤ m 3 with m = 6d n 6 e and we characterize the trees attaining this upper bound. Furthermore we provide a characterization of trees T with γ t ve(T) = γ t (T).