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 Joseph, Ancy Kandathil; Kureethara, Joseph Varghese Title A name given to the resource Antimagic labeling of n-uniform cactus chain 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 Discrete Mathematics, Algorithms and Applications;Volume;18;Issue;1;Article No.;2550015; Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1142/S1793830925500156" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793830925500156</a> <br /><br /><a href="https://www.scopus.com/pages/publications/85217639314?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/85217639314?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 Joseph A.K., Department of Mathematics, Christ University, Bangalore, 560029, India; Kureethara J.V., Department of Mathematics, Christ University, Bangalore, 560029, India Description An account of the resource A graph G = (V,E) is considered antimagic if it admits antimagic labeling. The antimagic labeling of a finite, simple graph with |V | = n and |E| = m is a bijective function from the set of edges to the set of integers {1, 2,,m} such that the vertex sum of n vertices is pairwise distinct. The vertex sum of a vertex is obtained by summing the labels of all edges incident to it. Hartsfield and Ringel conjectured that every connected graph different from K2 is antimagic. Supporting this conjecture, it was shown that the dense graphs are antimagic. A cactus graph is a connected graph where no edge lies within more than one cycle. A cactus graph in which each block is a cycle of the same size n is called an n-uniform cactus graph. We proved that Hartsfield and Ringels conjecture is true for n-uniform cactus chain graphs with and without pendant vertices, which are specific cases of sparse graphs. 2026 World Scientific Publishing Company. Subject The topic of the resource antimagic labeling; cactus chain graph; equivalence class; Graph labeling 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