Skip to main content

1 Result(s)

within Sayani Das Remove this filter Mathematics Remove this filter

and

  1. No Access

    Article

    On the complexity of minimum q-domination partization problems

    A domination coloring of a graph G is a proper vertex coloring with an additional condition that each vertex dominates a color class and each color class is dominated by a vertex. The minimum number of colors use...

    Sayani Das, Sounaka Mishra in Journal of Combinatorial Optimization (2022)