Domination-related colorings of n-inordinate invariant intersection graphs
S. Madhumitha, Sudev Naduvath
Source record
Source: Crossref
Published: Jun 28, 2025
DOI: 10.1142/s1793830925500983
Open original source ↗Source abstract
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 [Formula: see text]-inordinate invariant intersection graphs and the [Formula: see text]-inordinate invariant non-intersection graphs, that are constructed based on the symmetric group.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.