Global color class domination partition of a graph
MetadataShow full item record
CitationVenkatasubramanian, S. & Praba, V. (2019). Global color class domination partition of a graph. TWMS Journal of Applied and Engineering Mathematics, 9(3), 681-686.
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 class is dominated by a vertex. This concept is different from dominator color partition introduced in [, ] where every vertex dominates a color class. Suppose G has no full degree vertex (that is, a vertex which is adjacent with every other vertex of the graph). Then a color class may be independent from a vertex outside the class. This leads to Global Color Class Domination Partition. A proper color partition of G is called a Global Color Class Domination Partition if every color class is dominated by a vertex and each color class is independent of a vertex outside the class. The minimum cardinality of a Global Color Class Domination Partition is called the Global Color Class Domination Partition Number of G and is denoted by Xgcd(G). In this paper a study of this new parameter is initiated and its relationships with other parameters are investigated.
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.
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 ...
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 ...