On total vertex-edge domination
Citation
Şahin, B. & Şahin, A. (2019). On total vertex-edge domination. TWMS Journal Of Applied And Engineering Mathematics, 9(1), 128-133.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).
Source
TWMS Journal Of Applied And Engineering MathematicsVolume
9Issue
1SI
URI
https://hdl.handle.net/11729/2700http://jaem.isikun.edu.tr/web/index.php/archive/100-vol9no1/386
Collections
The following license files are associated with this item:
Related items
Showing items related by title, author, creator and subject.
-
Total roman domination number of graphs
Thakkar, Dineshbhai; Badiyani, Sanket (Işık University Press, 2022)In this paper a characterization of minimal total roman dominating functions has been proved. It has also been proved that if v is a pendant vertex and its neighbor u is not a pendant vertex then f(v) = 0 or 1 for any ... -
Graphs with equal domination and independent domination number
Vaidya, Samir K.; Pandit, R. M. (Işık University Press, 2015)A set S of vertices of a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. The independent domination number of G, denoted by i(G), is the ... -
Global color class domination partition of a graph
Swaminathan, Venkatasubramanian; Praba, Venkatrengan (Işık University Press, 2019)Color class domination partition was suggested by E. Sampathkumar and it was studied in [1]. A proper color partition of a finite, simple graph G is called a color class domination partition (or cd-partition) if every color ...