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 |
| Summary: | 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 chromatic number of G, denoted by χla(G), is the minimum number of distinct induced vertex labels over all local antimagic labelings of G. In this paper, several sufficient conditions to determine the local antimagic chromatic number of the join of graphs are obtained. We then determine the exact value of the local antimagic chromatic number of many join graphs. © 2024 World Scientific Publishing Company. |
|---|---|
| ISSN: | 17938309 |
| DOI: | 10.1142/S1793830923500222 |