Dominator colorings of \(n\)-inordinate invariant intersection graphs

Abstract

A special type of algebraic intersection graph called the \(n\)-inordinate invariant intersection graph has been constructed based on the symmetric group, and its structural properties are studied in the literature. In this article, we discuss the different types of dominator coloring schemes of the \(n\)-inordinate invariant intersection graphs and their complements, \(n\)-inordinate invariant non-intersection graphs, by obtaining the required coloring pattern and determining the graph invariant associated with the coloring.