On number of pendants in local antimagic chromatic number
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 anti...
Main Authors: | Lau, G.-C (Author), Ng, H.-K (Author), Shiu, W.-C (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor and Francis Ltd.
2021
|
Series: | Journal of Discrete Mathematical Sciences and Cryptography
|
Subjects: | |
Online Access: | View Fulltext in Publisher View in Scopus |
Similar Items
-
On Local Antimagic Chromatic Number of Cycle-Related Join Graphs
by: Lau Gee-Choon, et al.
Published: (2021-02-01) -
Affirmative Solutions on Local Antimagic Chromatic Number
by: Lau, G.-C, et al.
Published: (2020) -
ON LOCAL ANTIMAGIC CHROMATIC NUMBER OF GRAPHS
by: S. Shaebani
Published: (2020-01-01) -
On Local Antimagic Chromatic Number of Cycle-Related Join Graphs
by: Lau, G.-C, et al.
Published: (2021) -
ON LOCAL ANTIMAGIC CHROMATIC NUMBER OF CYCLE-RELATED JOIN GRAPHS
by: Lau, GC, et al.
Published: (2021)