Main Article Content
Abstract
An edge anti-magic total labelling, -EAMT, on graph with vertices and edges is bijektion , which has a set of edge weights with and . A super edge anti-magic total labelling , -SEAMT, if the vertex set of obtain the smallest labels . An -EAMT (SEAMT) labelling is called EMT (SEMT) labelling if and . Furthermore, is called the magic constant. A graph is said EMT, SEMT, -EAMT and -SEAMT if there is EMT, SEMT, -EAMT and -SEAMT labelling on graph , respectively. In this paper, we showed that the union of caterpillars and complete bipartite graph are SEAMT and SEMT, especialy for has (-SEAMT and -SEAMT with ; graph has -SEAMT and -SEAMT for ; and graph has -SEAMT and -SEAMT with where and for . Thus, graph is SEMT with for ; graph also SEMT with for ; as well graph is SEMT with for .
Keywords
Article Details
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).