SUPER (a; d)-EDGE ANTIMAGIC TOTAL LABELING OF CONNECTED SUNFLOWERS GRAPH

Abstract

A graph𝐺 of order 𝑝 and size 𝑞 is called an(𝑎,𝑑)-edge-antimagic if there exist a bijection 𝑓 ∶ 𝑉(𝐺) ∪ 𝐸(𝐺) → {1,2,…,𝑝 + 𝑞}such that the edge-weights𝑤(𝑢𝑣) = 𝑓(𝑢) + 𝑓(𝑣) + 𝑓(𝑢𝑣), 𝑢𝑣 ∈ 𝐸(𝐺), form an arithmetic sequence with first term term 𝑎 and common difference𝑑. Such a graph𝐺is called super if the smallest possible appear on the vertex labels. In this paper, we study super(𝑎,𝑑)-edgeantimagic total labeling connected properties of Sunflowers. The result shows that Sunflowers Graph admit a super edge antimagic total labeling for 𝑑 ∈ 0,1,2. 

Keywords: super (𝑎,𝑑)-edge-antimagic total labeling, Sunflowers