Pelabelan Antiajaib Berdasarkan Jarak pada Operasi Perkalian Tensor Graf
Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi · 2022
DOI: 10.34312/euler.v10i2.16298 ↗Kurz gefasst
Fachartikel in der Zeitschrift Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi, 2022. Verfasst von Christyan Tamaro Nadeak. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).
Abstract (Originalsprache)
Let be a graph of order n. Let be a bijection. For any vertex , the neighbor sum is called the weight of the vertex and is denoted by where N(v) is the open neighborhood of If for any two distinct vertices and then f is called a distance antimagic labelling. If the graph G admits such a labelling, then G is said to be a distance antimagic graph. This study gives a distance antimagic labelling for tensor product of two complete graph and sufficient condition so that the tensor product of a regular graph and complete graph is a distance antimagic graph.
Zitieren
APA
Nadeak, C. T. (2022). Pelabelan Antiajaib Berdasarkan Jarak pada Operasi Perkalian Tensor Graf. Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi. https://doi.org/10.34312/euler.v10i2.16298
Vancouver
Nadeak CT. Pelabelan Antiajaib Berdasarkan Jarak pada Operasi Perkalian Tensor Graf. Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi. 2022. doi:10.34312/euler.v10i2.16298
BibTeX
@article{Nadeak2022,
author = {Nadeak, Christyan Tamaro},
title = {Pelabelan Antiajaib Berdasarkan Jarak pada Operasi Perkalian Tensor Graf},
journal = {Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi},
year = {2022},
doi = {10.34312/euler.v10i2.16298}
}
EUVIMED