Coloring of n-inordinate invariant intersection graphs

Title

Coloring of n-inordinate invariant intersection graphs

Creator

Madhumitha S.; Naduvath S.

Description

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. 2024 The Author(s)

Source

Journal of Combinatorial Mathematics and Combinatorial Computing, Vol-123, pp. 369-381.

Date

2024-01-01

Publisher

Charles Babbage Research Centre

Subject

Fix of a permutation; Intersection graphs; Invariant intersection graph; n-inordinate invariant intersection graphs; Permutation group

Coverage

Madhumitha S., Department of Mathematics, Christ University, Bangalore, India; Naduvath S., Department of Mathematics, Christ University, Bangalore, India

Rights

Restricted Access

Relation

ISSN: 8353026

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.61091/jcmcc123-26

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85215416029&doi=10.61091%2fjcmcc123-26&partnerID=40&md5=41484988e5338520eda2ada92acc505e