Super d-anti-magic labeling of subdivided $kC_{5}$

Authors : MUHAMMAD HUSSAIN, ALI TABRAIZ

Pages : 773-783

View : 14 | Download : 4

Publication Date : 0000-00-00

Article Type : Research Paper

Abstract :A graph $insert ignore into journalissuearticles values(G=insert ignore into journalissuearticles values(V,E,F););$ admits labeling of type $insert ignore into journalissuearticles values(1,1,1);$ if we assign labels from the set $ \{1, 2, 3, . . . , |V insert ignore into journalissuearticles values(G);| +|Einsert ignore into journalissuearticles values(G);| + |Finsert ignore into journalissuearticles values(G);| \}$ to the vertices, edges, and faces of a planar graph $G$ in such a way that each vertex, edge, and face receives exactly one label and each number is used exactly once as a label and the weight of each face under the mapping is the same. Super $d$-antimagic labeling of type $insert ignore into journalissuearticles values(1,1,1);$ on snake $kC_{5}$, subdivided $kC_{5}$ as well as ismorphic copies of $kC_{5}$ for string $insert ignore into journalissuearticles values(1,1,...,1);$ and string $insert ignore into journalissuearticles values(2,2,...,2);$ is discussed in this paper.
Keywords : Super d anti magic labeling, snake graph