143-151
PELABELAN SELIMUT TOTAL SUPER (a,d)-H ANTIMAGIC PADA GRAPH LOBSTER BERATURAN L_n (q,r)
Authors: Tira Catur Rosalia, Luh Putu Ida Harini, Kartika Sari
Number of views: 418
Graph labelling is a function that maps graph elements to positive integers. A covering of graph G is H_i family subgraph from G, for 1≤i≤k with integer k. Graph G admits H covering if for every subgraph H_i is isomorphic to a graph H. A connected graph G (V,E) is an (a,d)- antimagic if there are positive integers a,d and bijective function f:E(G)→{1,2,3,…,|E(G)|} such that there are injective function g_f:V→N, defined by g_f (v)=∑▒〖{f(uv)|uv∈E(G)}〗 with g_f (V)={a,a+d,…,(|V|-1)d}. The purpose of this research is to determine a total super (a,d)-H antimagic covering on lobster graph L_n (q,r). The method of this research is literature study method. It is obtained that there are a total super (2nq^2 r^2+3nq^2+4nqr^2+7nqr-12nq+6nrq^2-16nr-22n+d+1,d)-L_2 (q,r) antimagic covering for d∈{1,3} on lobster graph L_n (q,r) with integer n≥3,r≥1, and even number q≥2.
Keywords : total super (a,d)-H antimagic covering, lobster graph, bat graph.