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}. In this art...
| Authors: | ; ; ; |
|---|---|
| Format: | Article |
| Status: | Published version |
| Publication date: | 2020 |
| Country: | Chile |
| Institution: | Agencia Nacional de Investigación y Desarrollo |
| Repository: | SciELO Chile |
| Language: | English |
| OAI Identifier: | oai:scielo:S0716-09172020000400995 |
| Online Access: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172020000400995 |
| Access Level: | Open access |
| Keyword: | Super edge-antimagic total graph Super vertex-antimagic total graph Duplication operations Prism Antiprism Crossed prism Cycle and complete graphs |
| Summary: | 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. |
|---|