GRACEFUL LABELING AND ˆ LABELING ON THE 8-BINTANG GRAPH

Authors

  • Zulfi amri universitas muhammadiyah sumatera utara
  • T. H Harahap
  • Irvan Irvan

Abstract

A graph G = (V,E) is ordered set V and E, where V is finite, nonempty set of objects called vertices or nodes, and E is the set of arcs. Graceful
labeling is an injective function f of the set of vertices V to the set of numbers {0, 1, 2, . . . , |E|} which induces the bijective function f0from the set of arc E to
the set of number {1, 2, . . . , |E|}, where each arc uv 2 E with node u, v 2 V apply f0(uv) = |f(u) − f(v)|, is aligned with the variations and modifications of graceful
labeling. The basic idea of constructing graceful labeling and ˆ labeling on an 8-Bintang graph begins with A-Bintang and H-Bintang. which is then referred to as
a star alphabet graph with the question how if the number is given a star graph Sn then a graph constructed from 2 circle graph where one vertex of the circle graph
becomes the center of the graph while the other node is given graph Star Sn. In this paper is given for 8-Bintang graph with C4 and C3 for n even.

Downloads

Download data is not yet available.

Published

2018-12-24