All graph in this paper are finite, simple and undirected. Let G, H be two graphs. A graph G is said to be an (a,d)-H-antimagic total graph if there exist a bijective function Â such that for all subgraphs Hâ€™ isomorphic to H, the total H-weights form an arithmetic progression Â where a, d 0 are integers and m is the number of all subgraphs Hâ€™ isomorphic to H. An (a, d)-H-antimagic total labeling f is called super if the smallest labels appear in the vertices. In this paper, we will study a super (a, d)-Bm-antimagicness of a connected and disconnected generalized amalgamation of fan graphs on which a path is a terminal.
Copyrights © 2017