Distance Magic Labeling of Corona Product of Graphs
Let G = (V, E) is a graph with order n, and f: V(G) → {1,2,...,n} is a bijection. For any vertex v ϵ V, the sum of f(u) is called the weight of vertex v, denoted by w(v), where N(v) is the set of neighbors of vertex v. If the labeling f satisfies that there exists a constant k such that w(v)=k, fo...
Na minha lista:
| Hovedforfatter: | |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
UIN Syarif Hidayatullah
2024-05-01
|
| Serier: | InPrime |
| Fag: | |
| Online adgang: | https://journal.uinjkt.ac.id/index.php/inprime/article/view/38317 |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|