Coloring of n-Inordinate Invariant Intersection Graphs

In the literature of algebraic graph theory, an algebraic intersection graph called the invariant intersection graph of a graph has been constructed from the automorphism group of a graph. A specific class of these invariant intersection graphs was identified as the n-inordinate invariant intersection graphs, and its structural properties has been studied. In this article, we study the different types of proper vertex coloring schemes of these n-inordinate invariant intersection graphs and their complements, by obtaining the coloring pattern and the chromatic number associated.