Edge H-domination in graph
MetadataShow full item record
CitationKakrecha, B. (2021). Edge H-domination in graph. TWMS Journal of Applied and Engineering Mathematics, 11(2), 448-458.
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 H-domination number of the graph is discussed. The changes in the edge H-domination number are observed under vertex(edge) removal operation on graph. The concepts called weak isolated edge and edge H-private neighborhood of the graph are defined.
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.
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 ...
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 ...
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 ...