Please use this identifier to cite or link to this item: https://repository.unej.ac.id/xmlui/handle/123456789/86175
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPrihandini, Rafiantika Megahnia-
dc.contributor.authorAgustin, Ika Hesti-
dc.contributor.authorDafik, Dafik-
dc.date.accessioned2018-07-04T06:40:21Z-
dc.date.available2018-07-04T06:40:21Z-
dc.date.issued2018-07-04-
dc.identifier.issn1742-6588-
dc.identifier.urihttp://repository.unej.ac.id/handle/123456789/86175-
dc.descriptionIOP Conf. Series: Journal of Physics: Conf. Series 1008 (2018)en_US
dc.description.abstractIn this paper we use simple and non trivial graph. If there exist a bijective function g : V (G) [ E(G) ! f1; 2; : : : ; jV (G)j + jE(G)jg, such that for all subgraphs P 2 B H of G isomorphic to H, then graph G is called an (a; d)-P B Hantimagic total graph. Furthermore, we can consider the total P B H-weights W(P 2 B H) = P v2V (P 2 BH) f(v) + P f(e) which should form an arithmetic sequence fa; a + d; a + 2d; :::; a + (n ¡ 1)dg, where a and d are positive integers and e2E(P 2 BH) n is the number of all subgraphs isomorphic to H. Our paper describes the existence of super (a; d)-P B H antimagic total labeling for graph operation of comb product namely of G = L B H, where L is a (b; d 2 ¤ )-edge antimagic vertex labeling graph and H is a connected graph.en_US
dc.language.isoenen_US
dc.subjecthe Construction of P2⊳H- antimagic graphen_US
dc.subjectsmaller edgeen_US
dc.subjectantimagic vertex labelingen_US
dc.titleThe Construction of P2⊳H- antimagic graph using smaller edge - antimagic vertex labelingen_US
dc.typeArticleen_US
Appears in Collections:LSP-Jurnal Ilmiah Dosen

Files in This Item:
File Description SizeFormat 
F. MIPA_Jurnal_Ika Hesti_The Construction of P2.pdf610.59 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.