%0 Journal Article
%T A Super (A,D)-Bm-Antimagic Total Covering of Ageneralized Amalgamation of Fan Graphs
%A Dafik Dafik
%A Ika Hesti Agustin
%A Rafiantika Megahnia Prihandini
%A Siti Latifah
%J -
%D 2017
%R http://dx.doi.org/10.18860/ca.v4i4.3758
%X 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
%K Super (a
%K d)-Bm-antimagic total covering
%K generalized amalgamation of fan graphs
%K connected and disconnected
%U http://ejournal.uin-malang.ac.id/index.php/Math/article/view/3758