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

rohmad wahid rhomdani

Abstract


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.


Refbacks

  • There are currently no refbacks.