On number of pendants in local antimagic chromatic number

Publication date 23 December 2022

Abstract: An edge labeling of a connected graph

G = (V, E)

is said to be local antimagic if it is a bijection

f : E o 1, l d o t s, | E |

such that for any pair of adjacent vertices

x

and

y

,

f^{+} (x) o t = f^{+} (y)

, where the induced vertex label

f^{+} (x) = s u m f (e)

, with

e

ranging over all the edges incident to

x

. The local antimagic chromatic number of

G

, denoted by

c h i_{l a} (G)

, is the minimum number of distinct induced vertex labels over all local antimagic labelings of

G

. Let

c h i (G)

be the chromatic number of

G

. In this paper, sharp upper and lower bounds of

c h i_{l a} (G)

for

G

with pendant vertices, and sufficient conditions for the bounds to equal, are obtained. Consequently, for

k g e 1

, there are infinitely many graphs with

k g e c h i (G) - 1

pendant vertices and

c h i_{l a} (G) = k + 1

. We conjecture that every tree

T_{k}

, other than certain caterpillars, spiders and lobsters, with

k g e 1

pendant vertices has

c h i_{l a} (T_{k}) = k + 1

.

Cites work

Cited in

(2)

This page was built for publication: On number of pendants in local antimagic chromatic number