On total vertex-edge domination
MetadataShow full item record
CitationŞahin, B. & Şahin, A. (2019). On total vertex-edge domination. TWMS Journal Of Applied And Engineering Mathematics, 9(1), 128-133.
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).
SourceTWMS Journal Of Applied And Engineering Mathematics
The following license files are associated with this item:
Showing items related by title, author, creator and subject.
Color class domination partition was suggested by E. Sampathkumar and it was studied in . A proper color partition of a finite, simple graph G is called a color class domination partition (or cd-partition) if every color ...
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 ...
Kakrecha, Bhavesh (Işık University Press, 2021)This paper is about edge H-domination of the graph. The edge H-dominating set is defined and the characterization of a minimal edge H-dominating set of the graph with minimum degree 2 is given. The upper bound on the edge ...