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...

Full description

Bibliographic Details
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