On (a, d)-SEAT labeling of forests of subdivided stars

Abstract

Graph ϒ = (V(ϒ), E(ϒ)) contain finite nodes V(ϒ) and finite edges E(ϒ). We also represent the order of the graph and size as μ = |V(ϒ)| and v = |V(ϒ)|. A graph is called (a, d)-edge magic total (EAT) labeling if there exists a bijective map ϕ from V(ϒ) ∪ E(ϒ) to the elements if the weight-set X = {ω(qr)|qr ∈ E(ϒ)} is arithmetic progression (A. P.) of positive integers which is started with a, d as common difference and ω(qr) = ϕ(q) + ϕ(qr) + ϕ(r). We say ω as the set of edge-weights. Further, if then the graph ϒ is said to be super (a, d)-edge antimagic total((a, d)-SEAT) labeling. In this article, we represent some new result on the (a, d)-SEAT labeling of some disjoint copies for subdivided star for the parameter .

Subject Classification: (2010):

• 05C78

Keywords:

• Star
• Subdivided Star
• (a, d)-SEAT labeling