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 Certain variants of domatic partitions 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-2026 Source A related resource from which the described resource is derived Asian-European Journal of Mathematics;Volume;19;Issue;2;Article No.;2540016; Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1142/S1793557125400169" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793557125400169</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105010020138?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105010020138?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., Center for Mathematical Needs, Department of Mathematics, Christ University, Karnataka, Bangalore, 560029, India; Naduvath S., Center for Mathematical Needs, Department of Mathematics, Christ University, Karnataka, Bangalore, 560029, India Description An account of the resource A class of algebraic intersection graphs, called the n-inordinate invariant intersection graphs, are introduced in the literature and several properties of these graphs are being investigated. Domination in graphs is an important structural property and partitioning the vertex set of a graph into dominating sets is called the domatic partition of a graph. In this paper, we analyze the structure of the n-inordinate invariant intersection graphs by investigating certain variants of domatic partitions of these graphs, that are defined based on different types of domination in graphs. 2026 World Scientific Publishing Company. Subject The topic of the resource domatic partition; domination; Invariant intersection graphs; n-inordinate invariant intersection graphs; symmetric group Publisher An entity responsible for making the resource available World Scientific Relation A related resource ISSN: 17935571; 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