Year: 2024
Type: article
Abstract: 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.
DOI: 10.61091/jcmcc123-26
Authors: S. Madhumitha, Sudev Naduvath
Institution: Christ University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W4406203422