Dergiler / TWMS Journal of Applied and Engineering Mathematics / 2019 / Cilt: 9 - Sayı: 1

ON TOTAL VERTEX-EDGE DOMINATION

Sayfa
1–2
DOI
—

Abstract

In this paper we obtain an improved upper bound of total vertex edgem domination number of a tree. If T is a connected tree with order n, then γtve T ≤n with m = 6de and we characterize the trees attaining this upper bound. Furthermorevewe provide a characterization of trees T with γt T = γt T