On join product and local antimagic chromatic number of regular graphs
Let G= (V, E) be a connected simple graph of order p and size q. A graph G is called local antimagic if G admits a local antimagic labeling. A bijection f: E→ { 1 , 2 , … , q} is called a local antimagic labeling of G if for any two adjacent vertices u and v, we have f+(u) ≠ f+(v) , where f+(u) = ∑...
Published in: | Acta Mathematica Hungarica |
---|---|
Main Author: | Lau G.-C.; Shiu W.C. |
Format: | Article |
Language: | English |
Published: |
Springer Science and Business Media B.V.
2023
|
Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85147375303&doi=10.1007%2fs10474-023-01298-7&partnerID=40&md5=5161cc053d90a45b44bbb43def593731 |
Similar Items
-
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 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 Number of Cycle-Related Join Graphs
by: Lau G.-C.; Shiu W.-C.; Ng H.-K.
Published: (2021) -
On local antimagic chromatic number of lexicographic product 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)