ON LOCAL ANTIMAGIC CHROMATIC NUMBER OF CYCLE-RELATED JOIN GRAPHS
An edge labeling of a connected graph G = (V, E) is said to be local antimagic if it is a bijection f : E -> {1, ..., vertical bar E vertical bar} such that for any pair of adjacent vertices x and y, f(+)(x) not equal f(+)(y), where the induced vertex label f(+)(x) = Sigma f(e), with e ranging ov...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2021
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |
| LEADER | 01386nam a2200205Ia 4500 | ||
|---|---|---|---|
| 001 | 10.7151-dmgt.2177 | ||
| 008 | 220223s2021 CNT 000 0 und d | ||
| 245 | 1 | 0 | |a ON LOCAL ANTIMAGIC CHROMATIC NUMBER OF CYCLE-RELATED JOIN GRAPHS |
| 260 | 0 | |c 2021 | |
| 856 | |z View Fulltext in Publisher |u https://doi.org/10.7151/dmgt.2177 | ||
| 520 | 3 | |a An edge labeling of a connected graph G = (V, E) is said to be local antimagic if it is a bijection f : E -> {1, ..., vertical bar E vertical bar} such that for any pair of adjacent vertices x and y, f(+)(x) not equal f(+)(y), where the induced vertex label f(+)(x) = Sigma f(e), with e ranging over all the edges incident to x. The local antimagic chromatic number of G, denoted by chi(la) (G), is the minimum number of distinct induced vertex labels over all local antimagic labelings of G. In this paper, several sufficient conditions for chi(la) (H) <= chi(la)(G) are obtained, where H is obtained from G with a certain edge deleted or added. We then determined the exact value of the local antimagic chromatic number of many cycle-related join graphs. | |
| 650 | 0 | 4 | |a cycle |
| 650 | 0 | 4 | |a join graphs |
| 650 | 0 | 4 | |a local antimagic chromatic number |
| 650 | 0 | 4 | |a local antimagic labeling |
| 650 | 0 | 4 | |a MAGIC RECTANGLES |
| 700 | 1 | 0 | |a Lau, GC |e author |
| 700 | 1 | 0 | |a Ng, HK |e author |
| 700 | 1 | 0 | |a Shiu, WC |e author |
| 773 | |t DISCUSSIONES MATHEMATICAE GRAPH THEORY | ||