David A. Kalarkop

collaborators

2 papers

math.CO2023

On irredundance coloring and irredundance compelling coloring of graphs

David Ashok Kalarkop, Pawaton Kaemawichanurat

Irredundance coloring of $G$ is a proper coloring in which there exists a maximal irredundant set $R$ such that all the vertices of $R$ have different colors. The minimum number of…

math.CO2022

On graphs whose domination number is equal to chromatic and dominator chromatic numbers

David A. Kalarkop, Pawaton Kaemawichanurat, Raghavachar Rangarajan

For a graph $G = (V (G), E (G))$ , a dominating set $D$ is a vertex subset of $V (G)$ in which every vertex of $V (G) ∖ D$ is adjacent to a vertex in $D$ . The domination number…