EN 
IN
Journal article
PELABELAN SELIMUT TOTAL SUPER (a,d)-H ANTIMAGIC PADA GRAPH LOBSTER BERATURAN Ln (q,r)
Tira Catur Rosalia Luh Putu Ida Harini Kartika Sari
Volume : 6 Nomor : 2 Published : 2017, May
E-JURNAL MATEMATIKA - Jurusan Matematika, Fakultas MIPA Universitas Udayana
Abstrak
Graph labelling is a function that maps graph elements to positive integers. A covering of graph is family subgraph from , for with integer k. Graph admits covering if for every subgraph is isomorphic to a graph . A connected graph is an - antimagic if there are positive integers and bijective function | | such that there are injective function , defined by ? | with | | . The purpose of this research is to determine a total super antimagic covering on lobster graph . The method of this research is literature study method. It is obtained that there are a total super antimagic covering for on lobster graph with integer and even number .