Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal E-Jurnal Matematika
TIRA CATUR ROSALIA
Mathematics Department, Faculty of Mathematics and Natural Sciences, Udayana University
Mathematics

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
PELABELAN SELIMUT TOTAL SUPER (a,d)-H ANTIMAGIC PADA GRAPH LOBSTER BERATURAN L_n (q,r) TIRA CATUR ROSALIA; LUH PUTU IDA HARINI; KARTIKA SARI
E-Jurnal Matematika Vol 6 No 2 (2017)
Publisher : Mathematics Department, Faculty of Mathematics and Natural Sciences, Udayana University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24843/MTK.2017.v06.i02.p159

Abstract

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 .
Co-Authors AA Sudharmawan, AA LUH PUTU IDA HARINI