?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=PENENTUAN+BANYAKNYA+GRAF+BERLABEL+DENGAN+ORDE+MAKSIMAL+ENAM+YANG+MEMUAT+GRAF+SIKLUS+DAN+LOOP+DENGAN+JUMLAH+LOOP+MAKSIMAL+ENAM&rft.creator=Annisa+Hevita+G.K.S.%2C+1417031016&rft.subject=Q+Science+(General)&rft.subject=QA+Mathematics&rft.description=%0D%0AGraf+siklus+(cycle)+atau+graf+lingkaran+merupakan+graf+sederhana+yang+setiap+simpulnya+berderajat+dua.+Graf+ini+dilambangkan+dengan+C_n.+Pelabelan+suatu+graf+adalah+graf+yang+secara+umum+dipresentasikan+dengan+titik+serta+himpunan+bilangan+asli+yang+disebut+label.+Loop+adalah+suatu+garis+yang+memiliki+titik+yang+sama+sebagai+kedua+ujungnya.+Jika+diberikan+n+titik+dan+l+garis%2C+maka+banyak+graf+yang+dapat+terbentuk+baik+terhubung+atau+tidak%2C+sederhana+atau+tidak.+Pada+penelitian+ini+akan+dibahas+tentang+cara+menentukan+banyaknya+graf+berlabel+dengan+3%E2%89%A4n%E2%89%A46+dan+l%E2%89%A46.+Hasil+dari+penelitian+ini+adalah+%E3%80%96N(G%E3%80%97_(n%2Cc%2Cl))%3D1%2F2+(l%2B1)(l%2B2)%E2%80%A6(l%2B(n-1))++++%3B++3%E2%89%A4n%E2%89%A46+%3Bl%E2%89%A46+.+Dengan+n+adalah+jumlah+titik+pada+graf%2C+dan+l+merupakan+jumlah+loop+pada+graf.%0D%0A%0D%0AKata+kunci%3A+graf%2C+graf+siklus%2C+loop%2C+dan+graf+berlabel%0D%0A%0D%0A%0D%0AABSTRACT%0D%0A%0D%0A%0D%0A%0D%0ACycle+graph+is+a+simple+graph+that+each+vertex+has+two+degrees.+This+graph+written+in+C_n.+A+graph+is+called+labeled+graph+if+each+vertex+or+each+edge+is+assigned+a+label+or+a+unique+name+(i.e.%2C+no+two+vertices+or+two+edges+have+the+same+labels).+Loop+is+an+edge+that+has+the+same+vertex+as+its+end.+Parallel+edges+are+two+or+more+edges+that+connected+two+same+vertices.+If+given+n+vertices+and+m+edges%2C+then+there+will+be+a+lot+of+graphs+formed%2C+whether+it+is+a+connected+or+disconnected+graphs%2C+simple+or+not.+In+this+research+we+will+discuss+how+to+determine+the+number+of+vertex+labeled+graphs+that+contain+cycle+graph+and+loop.+The+result+of+this+research+is+%E3%80%96N(G%E3%80%97_(n%2Cc%2Cl))%3D++1%2F2+(l%2B1)(l%2B2)%E2%80%A6(l%2B(n-1))++++%3B++3%E2%89%A4n%E2%89%A46++%3B+l%E2%89%A46%2C+with+n+is+the+number+of+vertices+and+l+is+the+number+of+loop+in+the+graph.%0D%0A%0D%0AKey+words%3A+graph%2C+cycle+graph%2C+loop%2C+and+labeled+graph.%0D%0A&rft.publisher=UNIVERSITAS+LAMPUNG&rft.date=2018-02-19&rft.type=Skripsi&rft.type=NonPeerReviewed&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F30744%2F1%2FABSTRAK.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F30744%2F3%2FSKRIPSI%2520FULL.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F30744%2F2%2FSKRIPSI%2520TANPA%2520BAB%2520PEMBAHASAN.pdf&rft.identifier=++Annisa+Hevita+G.K.S.%2C+1417031016++(2018)+PENENTUAN+BANYAKNYA+GRAF+BERLABEL+DENGAN+ORDE+MAKSIMAL+ENAM+YANG+MEMUAT+GRAF+SIKLUS+DAN+LOOP+DENGAN+JUMLAH+LOOP+MAKSIMAL+ENAM.++UNIVERSITAS+LAMPUNG%2C+FAKULTAS+MATEMATIKA+DAN+ILMU+PENGETAHUAN+ALAM.+++++&rft.relation=http%3A%2F%2Fdigilib.unila.ac.id%2F30744%2F