KADIKMA
Vol 6 No 3 (2015): Desember 2015

KETERAMPILAN BERPIKIR TINGKAT TINGGI DALAM KEANTIAJAIBAN SUPER TOTAL SELIMUT GRAF CIRCULANT

Elitta P Dewy (Universitas Jember)
Dafik Dafik (Universitas Jember)
Susi Setiawani (Universitas Jember)



Article Info

Publish Date
15 Aug 2017

Abstract

Abstract. Cover total Labeling (a, d) -H- antimagical on a graph G = (V, E) is a bijectivefunction of the vertices and edges of a graph on the set of integers from 1, 2, 3, ...|V(G)|+|E(G)|, for every subgraph H of G which is isomorphic with H has a total labelingdifferent and form the arithmetic sequence. H-lebeling is said to have super antimagicalif vertices labeling and edge labeling where the label of vertices less than the label ofedges . One technique that can be applied to get a super anti-magic total labeling blanketon a graph that is engineering the partition of the set of integers with different sets d.Partition symbolized In this article examines the super labeling (a,d)-

Copyrights © 2015






Journal Info

Abbrev

kadikma

Publisher

Subject

Mathematics

Description

KadikmA (p-ISSN: 2085-0662 dan e-ISSN: 2686-3243) adalah jurnal nasional bidang Matematika dan Pendidikan Matematika yang diterbitkan oleh Program Studi Pendidikan Matematika, FKIP, Universitas Jember. Kadikma terbit 3 kali dalam setahun pada bulan April, Agustus dan Desember. Jurnal Matematika dan ...