Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Title A name given to the resource Faculty Publications Article Faculty Publications -Articles Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Creator An entity primarily responsible for making the resource Madhumitha, S.; Naduvath, Sudev Title A name given to the resource Domination-related colorings of n-inordinate invariant intersection graphs Date A point or period of time associated with an event in the lifecycle of the resource 01-01-2025 Source A related resource from which the described resource is derived Discrete Mathematics, Algorithms and Applications;Issue;;Article No.;2550098; Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1142/S1793830925500983" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793830925500983</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105009427784?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105009427784?origin=resultslist</a> Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Madhumitha S., Department of Mathematics, Christ University, Bangalore, India; Naduvath S., Department of Mathematics, Christ University, Bangalore, India Description An account of the resource 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. Subject The topic of the resource coloring; domination; domination-related colorings; Invariant intersection graphs; n-inordinate invariant intersection graphs Publisher An entity responsible for making the resource available World Scientific Relation A related resource ISSN: 17938309; Language A language of the resource English Type The nature or genre of the resource Article Rights Information about rights held in and over the resource Restricted Access; Hardcopy may be available in the library Format The file format, physical medium, or dimensions of the resource online