On local antimagic chromatic number of cycle-related join graphs II
An edge labeling of a 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 of x is f+(x) = Σϵ∈E(x)f(e) (E(x) is the set of edges incident to x). The local antimagic chr...
| Published in: | Discrete Mathematics, Algorithms and Applications |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
World Scientific
2024
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85153935842&doi=10.1142%2fS1793830923500222&partnerID=40&md5=8a036ee04fee2ec572338246d49ed291 |