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, |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 antimagic chr...
Published in: | Discussiones Mathematicae - Graph Theory |
---|---|
Main Author: | |
Format: | Article |
Language: | English |
Published: |
Sciendo
2021
|
Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85099496674&doi=10.7151%2fdmgt.2177&partnerID=40&md5=7aaceeb0147172d378244367b2b787e8 |
id |
2-s2.0-85099496674 |
---|---|
spelling |
2-s2.0-85099496674 Lau G.-C.; Shiu W.-C.; Ng H.-K. On Local Antimagic Chromatic Number of Cycle-Related Join Graphs 2021 Discussiones Mathematicae - Graph Theory 41 1 10.7151/dmgt.2177 https://www.scopus.com/inward/record.uri?eid=2-s2.0-85099496674&doi=10.7151%2fdmgt.2177&partnerID=40&md5=7aaceeb0147172d378244367b2b787e8 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 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 for χla(H) ≤ χ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. © 2021 Gee-Choon Lau et al., published by Sciendo. Sciendo 12343099 English Article All Open Access; Gold Open Access; Green Open Access |
author |
Lau G.-C.; Shiu W.-C.; Ng H.-K. |
spellingShingle |
Lau G.-C.; Shiu W.-C.; Ng H.-K. On Local Antimagic Chromatic Number of Cycle-Related Join Graphs |
author_facet |
Lau G.-C.; Shiu W.-C.; Ng H.-K. |
author_sort |
Lau G.-C.; Shiu W.-C.; Ng H.-K. |
title |
On Local Antimagic Chromatic Number of Cycle-Related Join Graphs |
title_short |
On Local Antimagic Chromatic Number of Cycle-Related Join Graphs |
title_full |
On Local Antimagic Chromatic Number of Cycle-Related Join Graphs |
title_fullStr |
On Local Antimagic Chromatic Number of Cycle-Related Join Graphs |
title_full_unstemmed |
On Local Antimagic Chromatic Number of Cycle-Related Join Graphs |
title_sort |
On Local Antimagic Chromatic Number of Cycle-Related Join Graphs |
publishDate |
2021 |
container_title |
Discussiones Mathematicae - Graph Theory |
container_volume |
41 |
container_issue |
1 |
doi_str_mv |
10.7151/dmgt.2177 |
url |
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85099496674&doi=10.7151%2fdmgt.2177&partnerID=40&md5=7aaceeb0147172d378244367b2b787e8 |
description |
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 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 for χla(H) ≤ χ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. © 2021 Gee-Choon Lau et al., published by Sciendo. |
publisher |
Sciendo |
issn |
12343099 |
language |
English |
format |
Article |
accesstype |
All Open Access; Gold Open Access; Green Open Access |
record_format |
scopus |
collection |
Scopus |
_version_ |
1809677597587537920 |