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: | Lau G.-C.; Shiu W.-C.; Ng H.-K. |
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 |
Similar Items
-
On local antimagic chromatic number of cycle-related join graphs II
by: Lau G.-C.; Premalatha K.; Arumugam S.; Shiu W.C.
Published: (2024) -
On local antimagic chromatic numbers of circulant graphs join with null graphs or cycles
by: Lau G.C.; Premalatha K.; Shiu W.C.; Nalliah M.
Published: (2023) -
On join product and local antimagic chromatic number of regular graphs
by: Lau G.-C.; Shiu W.C.
Published: (2023) -
Local distance antimagic cromatic number of join product of graphs with cycles or paths
by: Shiu W.C.; Lau G.-C.; Nalliah M.
Published: (2024) -
On Local Antimagic Chromatic Number of Graphs with Cut-vertices
by: Lau G.-C.; Shiu W.-C.; Ng H.-K.
Published: (2024)