EVERY GRAPH IS LOCAL ANTIMAGIC TOTAL AND ITS APPLICATIONS
Let G = (V, E) be a simple graph of order p and size q. A graph G is called local antimagic (total) if G admits a local antimagic (total) labeling. A bijection g : E → {1, 2,..., q} is called a local antimagic labeling of G if for any two adjacent vertices u and v, we have g+(u) ≠ g+(v), where g+(u)...
| Published in: | Opuscula Mathematica |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
AGH University of Science and Technology
2023
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85170201438&doi=10.7494%2fOpMath.2023.43.6.841&partnerID=40&md5=24ba28f4666342199f729da3b72c2d07 |