| dc.creator | Ragukumar, P. | |
| dc.date | 2023-05-10 | |
| dc.date.accessioned | 2023-05-11T20:42:09Z | |
| dc.date.available | 2023-05-11T20:42:09Z | |
| dc.identifier | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/5220 | |
| dc.identifier | 10.22199/issn.0717-6279-5220 | |
| dc.identifier.uri | https://revistaschilenas.uchile.cl/handle/2250/225575 | |
| dc.description | An anti-magic labeling of a graph G is a one-to-one correspondence between E(G) and {1, 2, ··· , |E|} such that the vertex-sum for distinct vertices are different. Vertex-sum of a vertex u ∈ V (G) is the sum of labels assigned to edges incident to the vertex u. It was conjectured by Hartsfield and Ringel that every tree other than K2 has an anti-magic labeling. In this paper, we consider various binary graph products such as corona, edge corona and rooted products to generate anti-magic graphs. We prove that corona products of an anti-magic regular graph G with K1 and K2 are anti-magic. Further, we prove that rooted product of two anti-magic trees are anti-magic. Also, we prove that rooted product of an anti-magic graph with an anti-magic tree admits anti-magic labeling. | en-US |
| dc.format | application/pdf | |
| dc.language | eng | |
| dc.publisher | Universidad Católica del Norte. | en-US |
| dc.relation | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/5220/4291 | |
| dc.rights | Copyright (c) 2023 P. Ragukumar | en-US |
| dc.rights | https://creativecommons.org/licenses/by/4.0 | en-US |
| dc.source | Proyecciones (Antofagasta, On line); Vol. 42 No. 3 (2023); 651-661 | en-US |
| dc.source | Proyecciones. Revista de Matemática; Vol. 42 Núm. 3 (2023); 651-661 | es-ES |
| dc.source | 0717-6279 | |
| dc.source | 10.22199/issn.0717-6279-2023-03 | |
| dc.subject | corona product | en-US |
| dc.subject | edge corona product | en-US |
| dc.subject | rooted product | en-US |
| dc.subject | anti-magic graphs | en-US |
| dc.subject | 05C78 | en-US |
| dc.subject | 05C05 | en-US |
| dc.title | Generation of anti-magic graphs from binary graph products | en-US |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
| dc.type | Peer-reviewed Article | en-US |
| dc.type | text | en-US |
