Affirmative Solutions on Local Antimagic Chromatic Number
An edge labeling of a connected graph G= (V, E) is said to be local antimagic if it is a bijection f: E→ { 1 , … , | E| } such that for any pair of adjacent vertices x and y, f+(x) ≠ f+(y) , where the induced vertex label f+(x) = ∑ f(e) , with e ranging over all the edges incident to x. The local an...
| Published in: | Graphs and Combinatorics |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer
2020
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85086567268&doi=10.1007%2fs00373-020-02197-2&partnerID=40&md5=5af16c465252b801bb69976d8256f94d |