Super antimagic total labeling under duplication operations

• Khalaf, Abdul Jalil M. ^[1] ; Naeem, Muhammad ^[3] ; Siddiqui, Muhammad Kamran ^[2] ; Baig, Abdul Qudair ^[3]
  1. [1] University of Kufa

     University of Kufa

     Irak

     
  2. [2] COMSATS Institute of Information Technology

     COMSATS Institute of Information Technology

     Pakistán

     
  3. [3] Institute of Southern Punjab.

  Mostrar afiliaciones +
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 39, Nº. Extra 4, 2020 (Ejemplar dedicado a: Special Issue: Mathematical Computation in Combinatorics and Graph Theory; i), págs. 995-1003
• Idioma: inglés
• DOI: 10.22199/issn.0717-6279-2020-04-0062
• Enlaces
  • Texto completo
• Resumen

  • For 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.

• Referencias bibliográficas
  • M. Ba?a, F. Bertault, J. Macdougall, M. Miller, R. Simanjuntak, and Slamin, “Vertex-antimagic total labelings of graphs”, Discussiones mathematicae...
  • R. M. Figueroa-Centeno, R. Ichishima, and F. A. Muntaner-Batle, “On super edge-magic graphs”, Ars combinatoria, vol. 64, pp. 81-95, 2002....
  • P. Ková? and J. A. Gallian, “Magic labelings of regular graphs”, AKCE international journal of graphs and combinatorics, vol. 4, no. 3, pp....
  • J. Sedlá?ek, “On magic graphs”, Mathematica slovaca, vol. 26, no. 4, pp. 329-335, 1976. [On line]. Available: https://bit.ly/3e9Ygy6
  • K. A. Sugeng, M. Miller, Y. Lin, and M. Ba?a, “Super (a,d)-vertex antimagic total labelings”, Journal of combinatorial mathematics and combinatorial...
  • S. K. Vaidya and C. M. Barasara, “Product cordial graphs in the context of some graph operations”, International journal of computing science...
  • S. K. Vaidya and N. A. Dani, “Cordial and 3-equitable graphs induced by duplication of edge”, Mathematics today, vol. 27, pp. 71-82, 2011.