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 a...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer,
2020
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher View in Scopus |