Authors:

TIRA CATUR ROSALIA, LUH PUTU IDA HARINI, KARTIKA SARI

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 .”

Keywords

Keyword Not Available

Downloads:

Download data is not yet available.

References

References Not Available

PDF:

https://jurnal.harianregional.com/mtk/full-30826

Published

2017-05-31

How To Cite

ROSALIA, TIRA CATUR; HARINI, LUH PUTU IDA; SARI, KARTIKA. PELABELAN SELIMUT TOTAL SUPER (a,d)-H ANTIMAGIC PADA GRAPH LOBSTER BERATURAN L_n (q,r).E-Jurnal Matematika, [S.l.], v. 6, n. 2, p. 143-151, may 2017. ISSN 2303-1751. Available at: https://jurnal.harianregional.com/mtk/id-30826. Date accessed: 28 Aug. 2025. doi:https://doi.org/10.24843/MTK.2017.v06.i02.p159.

Citation Format

ABNT, APA, BibTeX, CBE, EndNote - EndNote format (Macintosh & Windows), MLA, ProCite - RIS format (Macintosh & Windows), RefWorks, Reference Manager - RIS format (Windows only), Turabian

Issue

Vol 6 No 2 (2017)

Section

Articles

Creative Commons License This work is licensed under a Creative Commons Attribution 4.0 International License