Equitable dominator coloring of graphs
Citation
George, P. S., Madhumitha, S. & Sudev, N. K. (2025). Equitable dominator coloring of graphs. TWMS Journal of Applied and Engineering Mathematics, 15(10), 2519-2529.Abstract
This paper introduces a variant of domination-related coloring of graphs, called the equitable dominator coloring of graphs, which is a combination of equitable coloring and dominator coloring of graphs. The minimum number of colors used in an equitable dominator coloring of a graph is its equitable dominator chromatic number. The equitable dominator coloring and the equitable dominator chromatic number of some standard graph classes are investigated in this paper.
Volume
15Issue
10URI
https://jaem.isikun.edu.tr/web/index.php/current/136-vol15no10/1507https://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/7054
Collections
The following license files are associated with this item:
Related items
Showing items related by title, author, creator and subject.
-
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 ... -
Edge incident 2-edge coloring sum of graphs
Joseph, Anu; Dominic, Charles (Işık University Press, 2025-01)The edge incident 2-edge coloring number, ψ′ein2(G), of a graph G is the highest coloring number used in an edge coloring of a graph G such that the edges incident to an edge e = uv in G is colored with at most two distinct ... -
Analysis and computations of chromatic index for a class of integral sum graphs based on edge coloring and edge-sum coloring
Priyanka, B.R.; Pandit, Biswajit; Rajeshwari, Madevappa; Agarwal, Ravi (Işık University Press, 2025-01)We consider families of integral sum graphs H−i,s m,ϕ and H−i,s ϕ,j , where −i < 0 < s, 1 ≤ m < i and 1 ≤ j < s for all i, s, m, j ∈ N. Since the graphs contains parameters i and s, so it is difficult to compute theoretical ...