Certain variants of domatic partitions of n-inordinate invariant intersection graphs

A class of algebraic intersection graphs, called the [Formula: see text]-inordinate invariant intersection graphs, are introduced in the literature and several properties of these graphs are being investigated. Domination in graphs is an important structural property and partitioning the vertex set of a graph into dominating sets is called the domatic partition of a graph. In this paper, we analyze the structure of the [Formula: see text]-inordinate invariant intersection graphs by investigating certain variants of domatic partitions of these graphs, that are defined based on different types of domination in graphs.