On local antimagic total labeling of complete graphs amalgamation

Abstract: Let

G = (V, E)

be a connected simple graph of order

p

and size

q

. A graph

G

is called local antimagic (total) if

G

admits a local antimagic (total) labeling. A bijection

g : E o 1, 2, l d o t s, q

is called a local antimagic labeling of

G

if for any two adjacent vertices

u

and

v

, we have

g^{+} (u) e g^{+} (v)

, where

g^{+} (u) = s u m_{e i n E (u)} g (e)

, and

E (u)

is the set of edges incident to

u

. Similarly, a bijection

f : V (G) c u p E (G) o 1, 2, l d o t s, p + q

is called a local antimagic total labeling of

G

if for any two adjacent vertices

u

and

v

, we have

w_{f} (u) e w_{f} (v)

, where

w_{f} (u) = f (u) + s u m_{e i n E (u)} f (e)

. Thus, any local antimagic (total) labeling induces a proper vertex coloring of

G

if vertex

v

is assigned the color

g^{+} (v)

(respectively,

w_{f} (u)

). The local antimagic (total) chromatic number, denoted

c h i_{l a} (G)

(respectively

c h i_{l a t} (G)

), is the minimum number of induced colors taken over local antimagic (total) labeling of

G

. In this paper, we determined

c h i_{l a t} (G)

where

G

is the amalgamation of complete graphs.

Recommendations

Cites work

Cited in

(2)

This page was built for publication: On local antimagic total labeling of complete graphs amalgamation