Coalition partitions of n-inordinate invariant intersection graphs

A class of algebraic intersection graphs, called the [Formula: see text]-inordinate invariant intersection graphs, has been introduced and various properties of these graphs are investigated in the literature. Domination is an important structural property in graphs and the notion of coalition in graphs has been recently introduced based on different types of domination in graphs. In this article, we analyse the structure of the [Formula: see text]-inordinate invariant intersection graphs by investigating certain variants of domination based coalition partitions of them.