Abstract
A Labeling of a plane graph G is called d-antimagic if every numbers, the set of s-sided face weights is Ws={as,as+d,as+2d,...,as+(fs-1)d} for some integers as and d (as>0,d≥0),where fs is the number of s-sided faces. We allow differentsets ws of different s.In this paper, we proved the existence of face antimagic labeling of types (1,0,0),(1,0,1),(1,1,0),(0,1,1) and (1,1,1) of double duplication of all vertices by edges of a cycle graph Cn: n≥3 and a tree of order n.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have