Domination-related colorings of n-inordinate invariant intersection graphs

Title

Domination-related colorings of n-inordinate invariant intersection graphs

Creator

Madhumitha, S.; Naduvath, Sudev

Description

Algebraic graph theory is an intriguing field of research in which various properties of graphs constructed based on algebraic structures are studied. Interlacing two important structural aspects of graphs namely, coloring, and domination in graphs, several domination-related colorings of graphs are introduced in the literature. In this paper, we study such domination-related colorings of algebraic graphs, called the n-inordinate invariant intersection graphs and the n-inordinate invariant non-intersection graphs, that are constructed based on the symmetric group. 2025 World Scientific Publishing Company.

Source

Discrete Mathematics, Algorithms and Applications;Issue;;Article No.;2550098;

Date

01-01-2025

Publisher

World Scientific

Subject

coloring; domination; domination-related colorings; Invariant intersection graphs; n-inordinate invariant intersection graphs

Coverage

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

Rights

Restricted Access; Hardcopy may be available in the library

Relation

ISSN: 17938309;

Format

online

Language

English

Type

Article

Identifier

https://doi.org/10.1142/S1793830925500983

https://www.scopus.com/pages/publications/105009427784?origin=resultslist