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 Samuel, Libin Chacko; Joseph, Mayamma Title A name given to the resource The total upper domatic number of a graph 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 Asian-European Journal of Mathematics;Volume;18;Issue;5;Article No.;2450138; Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1142/S1793557124501389" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793557124501389</a> <br /><br /><a href="https://www.scopus.com/pages/publications/85215435703?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/85215435703?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 Samuel L.C., Department of Mathematics, Christ University, India; Joseph M., Department of Mathematics, Christ University, India Description An account of the resource Let G = (V,E) be a graph with no isolated vertices. For two disjoint subsets A and B of V, if every vertex in B is adjacent to at least one vertex in A, then the set A is said to dominate set B. A partition ? = {V1,V2,,Vk} of the vertex set V is a total upper domatic partition of G if Vi dominates Vj or Vj dominates Vi or both, for any Vi,Vj ? ? and G[Vi], 1 ? i ? k, has no isolated vertices. The total upper domatic number Dt(G) of G is the maximum order of a total upper domatic partition of G. In this paper, we initiate a study on the concept of total upper domatic number and determine the bounds of Dt(G) and exact values of the same for some classes of graphs. 2025 World Scientific Publishing Company. Subject The topic of the resource Domatic number; total upper domatic number; upper domatic number 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