Show simple item record

Super antimagic total labeling under duplication operations

dc.creatorKhalaf, Abdul Jalil M.
dc.creatorNaeem, Muhammad
dc.creatorSiddiqui, Muhammad Kamran
dc.creatorBaig, Abdul Qudair
dc.date2020-07-28
dc.date.accessioned2020-07-29T16:38:01Z
dc.date.available2020-07-29T16:38:01Z
dc.identifierhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/4323
dc.identifier10.22199/issn.0717-6279-2020-04-0062
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/147150
dc.descriptionFor a graph G the duplication operation of a vertex v by a new edge e = uw results in a new graph G’ such that N (u) = {v, w} and N (w) = {v, u}. The duplication operation of an edge e = uv by a new vertex w results in a new graph G’’ such that N (w) = {u, v}. In this article we have discussed that the properties of a graph, with minimum degree 2 of any vertex, to be super vertex-antimagic total and to be super edge-antimagic total are invariant under the above duplication operations. Also, we have discussed on the existence of the so-called k super vertex-antimagic total vertex modifications and k super edge-antimagic total edge modifications for graphs.en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad Católica del Norte.en-US
dc.relationhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/4323/3493
dc.rightsCopyright (c) 2020 Muhammad Naeem, Muhammad Kamran Siddiqui, Abdul Qudair Baigen-US
dc.rightshttp://creativecommons.org/licenses/by/4.0en-US
dc.sourceProyecciones (Antofagasta, On line); Vol. 39 No. 4 (2020): Special Issue: Mathematical Computation in Combinatorics and Graph Theory; 995-1003en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 39 Núm. 4 (2020): Special Issue: Mathematical Computation in Combinatorics and Graph Theory; 995-1003es-ES
dc.source0717-6279
dc.source10.22199/issn.0717-6279-2020-04
dc.subjectSuper edge-antimagic total graphen-US
dc.subjectSuper vertex-antimagic total graphen-US
dc.subjectDuplication operationsen-US
dc.subjectPrismen-US
dc.subjectAntiprismen-US
dc.subjectCrossed prismen-US
dc.subjectCycle and complete graphsen-US
dc.subject05C70en-US
dc.subjectEdge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)en-US
dc.subject05C75en-US
dc.subjectStructural characterization of families of graphsen-US
dc.subject05C78en-US
dc.subjectGraph labelling (graceful graphs, bandwidth, etc.)en-US
dc.titleSuper antimagic total labeling under duplication operationsen-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typePeer-reviewed Articleen-US
dc.typetexten-US


This item appears in the following Collection(s)

Show simple item record