On local antimagic chromatic number of spider 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 antim...
Saved in:
Main Authors: | Lau, Gee-Choon, Shiu, Wai-Chee, Soo, Chee-Xian |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/162736 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
The Set Chromatic Numbers of the Middle and Total Graphs of a Graph
by: Eugenio, Gerone Russel
Published: (2020) -
Sigma Chromatic Number of the Middle Graph of Some Families of Graphs
by: Manamtam, Jay-R
Published: (2021) -
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs
by: Dong, F.M., et al.
Published: (2014) -
Recursive Linear Bounds for the Vertex Chromatic Number of the Pancake Graph
by: Asuncion, Aldrich Ellis C, et al.
Published: (2022) -
On graphs having no chromatic zeros in (1, 2)
by: Dong, F.M., et al.
Published: (2014)