Breaking News
EKSPLORASI ASPEK ANALISIS KREDIT SYARIAH | ANALISIS KUALITAS PRODUK, PROMOSI, DAN HARGA TERHADAP KEPUTUSAN PEMBELIAN KARTU TELKOMSEL 4G LTE DI MANADO (STUDI KASUS : FAKULTAS EKONOMI DAN BISNIS DI UNIVERSITAS SAM RATULANGI) | PENGARUH BUDAYA ORGANISASI, DISIPLIN KERJA, DAN LINGKUNGAN KERJA TERHADAP KINERJA | PENERAPAN AKUNTANSI ZAKAT DAN INFAK/SEDEKAH BERDASARKAN PSAK 109 BADAN AMIL ZAKAT KOTA BITUNG

HTML

Iklan

PELABELAN SUPER GRACEFUL UNTUK BEBERAPA GRAF KHUSUS

PELABELAN SUPER GRACEFUL UNTUK BEBERAPA GRAF KHUSUS
Abstract: Given a graph , super graceful labeling is bijective function  such that  for every edge. A graph  that has a super graceful labeling called a super graceful graph. In this  final paper discuss about super graceful labeling for special graphs graph Pn , graph Pm(n) , graph Pn+-e1 , graph Cn n≥3 graph Pn1,2,…,n , graph Km,n , and graph Coconut tree
Keywords: Graph labeling, super graceful labeling, super graceful graph
Penulis: Primas Tri Anjar Anjani, Robertus Heri SU
Kode Jurnal: jpmatematikadd120033
Share This :
REDAKSI

comment 0 komentar

more_vert
:)
:(
hihi
:-)
:D
=D
:-d
;(
;-(
@-)
:P
:o
-_-
(o)
[-(
:-?
(p)
:-s
(m)
8-)
:-t
:-b
b-(
:-#
=p~
$-)
(y)
(f)
x-)
(k)
(h)
(c)
cheer
(li)
(pl)
Subscribe to: Post Comments (Atom)