KETERAMPILAN BERPIKIR TINGKAT TINGGI DALAM KEANTIAJAIBAN SUPER TOTAL SELIMUT GRAF CIRCULANT

Abstract

Abstract. Cover total Labeling (a, d) -H- antimagical on a graph G = (V, E) is a bijective
function 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 labeling
different and form the arithmetic sequence. H-lebeling is said to have super antimagical
if vertices labeling and edge labeling where the label of vertices less than the label of
edges . One technique that can be applied to get a super anti-magic total labeling blanket
on 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)-