Super antimagic total labeling under duplication operations

Abstract: 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}....

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Khalaf,Abdul Jalil M., Naeem,Muhammad, Siddiqui,Muhammad Kamran, Baig,Abdul Qudair
Lenguaje:English
Publicado: Universidad Católica del Norte, Departamento de Matemáticas 2020
Materias:
Acceso en línea:http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172020000400995
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
Descripción
Sumario:Abstract: 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.