Pelabelan super graceful pada graph tripartisi komplit K(1, 1, r) dan graph firecrackers Pn0Sn / Bety Ratnaningtyas
| Main Author: | Ratnaningtyas, Bety |
|---|---|
| Format: | Thesis NonPeerReviewed |
| Terbitan: |
, 2017
|
| Subjects: | |
| Online Access: |
http://repository.um.ac.id/17491/ |
Daftar Isi:
- ABSTRAKRatnaningtyasBety.2017.PelabelanSuperGracefulpadaGraphTripartisiKomplitK(11r)danGraphFirecrackersP_n920S_m.SkripsiJurusanMatematikaFMIPAUniversitasNegeriMalang.Pembimbing(I)Prof.Drs.PurwantoPh.D.KataKuncigraphpelabelanpelabelansupergracefulgraphK(11r)graphP_n920S_mPemetaanbijektiffV(C)8746E(G)859412pqdisebutpelabelansupergracefuljikasetiapsisiuvmendapatkanlabelf(uv)f(u)-f(v)untuksetiapsisiuvdiE(G).Suatugraphdikatakansupergracefuljikamemuatpelabelansupergraceful.PadaliteraturtelahdibahasbahwagraphK(11r)merupakangraphsupergraceful.GraphK(11r)adalahgraphyangmemuattigahimpunantitiktitik-titikdalamsuatuhimpunanterhubunghanyaketitik-titikpadahimpunan-himpunanyanglain.PembuktiandilakukandengancaramembuktikanbahwafungsipelabelantitikdanfungsipelabelansisinyamerupakanpemetaanbijektifdenganhimpunanpelabelantitikdansisinyaV8746E123r3.PadaskripsiiniditemukanhasilbaruyaitugraphP_n920S_myangmerupakangraphsupergracefuluntukm88052dann88052.GraphP_n920S_mmerupakangraphyangterbentukdarigraphlintasanyangdisetiaptitik-titikujungnyadiberikangraphbintangS_m.PembuktiandilakukandengancaramembuktikanbahwafungsipelabelantitikdanfungsipelabelansisinyamerupakanpemetaanbijektifdenganhimpunanpelabelantitikdansisinyaV8746E12...2(n2m)-1.ABSTRACTRatnaningtyasBety.2017.SuperGracefulLabelingonCompleteTripartiteGraphK(11r)andFirecrackersGraphP_n920S_m.UnpublishedThesisMathematicsDepartmentFacultyofMathematicsandScienceStateUniversityofMalang.Advisor(I)Prof.Drs.PurwantoPh.D.KeywordsgraphlabelingsupergracefullabelingK(11r)graphP_n920S_mgraph.AbijectionfV(C)8746E(G)859412pqiscalledasupergracefullabelingifeveryedgeuvgetthelabelf(uv)f(u)-f(v)foreveryedgeuvinE(G).Agraphiscalledsupergracefulifitadmitsasupergracefullabeling.IntheliteratureithasbeendiscussedthatgraphK(11r)isasupergracefulgraph.GraphK(11r)isagraphthatcontainsthreesetsofverticesandverticesinasetareconnectedonlytoverticesinothersets.ProofisdonebyprovingthetthelabelingfunctionvertexandedgelabelingfunctionisabijectivemappingwiththesetoflabelingofvertexandedgesV8746E123r3.InthisthesisthenewresultarefoundgraphP_n920S_mwhichisasupergracefulgraphform88052andn88052.GraphP_n920S_misagraphformedbythepathgraphinwhicheachendpointisgivenstargraphS_m.ProofisdonebyprovingthetthelabelingfunctionvertexandedgelabelingfunctionisabijectivemappingwiththesetoflabelingofvertexandedgesV8746E12..2(n2m)-1.