?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=PENENTUAN+BANYAKNYA+GRAF+TAK+TERHUBUNG+BERLABEL+TITIK+TANPA+GARIS+PARALEL+DENGAN+BANYAKNYA+TITIK+n+%3D+6%0D%0ADAN+BANYAKNYA+GARIS+m+%E2%89%A5+1%0D%0A&rft.creator=PRISKY+PARADITTA+%2C+1217031050&rft.subject=+&rft.subject=QA+Mathematics&rft.description=ABSTRAK%0D%0A%0D%0AGraf+G(V%2CE)+dikatakan+graf+terhubung+jika+untuk+setiap+dua+titik+pada+graf+tersebut+terdapat+path+yang+menghubungkannya.+Jika+tidak+ada+path+yang+menghubungkan+antara+kedua+pasang+titik+di+G+maka+G+tidak+terhubung.+Suatu+graf+dikatakan+graf+berlabel+jika+setiap+titik+atau+sisinya+diberi+label+atau+nama+tertentu+(dengan+dua+titik+atau+dua+sisi+tidak+memiliki+label+yang+sama).+Loop+adalah+suatu+garis+yang+titik+awal+dan+titik+akhirnya+sama.+Garis+paralel+adalah+dua+garis+atau+lebih+yang+menghubungkan+dua+titik+yang+sama.+Jika+diberikan+n+titik+dan+m+garis%2C+maka+banyak+graf+yang+dapat+terbentuk+baik+terhubung+atau+tidak%2C+sederhana+atau+tidak.+Pada+penelitian+ini+dibahas+tentang+cara+menentukan+banyaknya+graf+terhubung+berlabel+titik+tanpa+garis+paralel+jika+diberikan+n%3D6+dan+m%E2%89%A51.+Hasil+dari+penelitian+ini+adalah+sebagai+berikut+%3A%0D%0AN(%E3%80%96G'%E3%80%97_(6%2Cm)+)%3D+N(%E3%80%96G'(l)%E3%80%97_(6%2Cm)+)%2B%E2%88%91_(g%3D1)%5E10%E2%96%92%E3%80%96N(%E3%80%96G'%E3%80%97_(6%2Cm%2Cl%2Cg))%E3%80%97+%0D%0A%3D((m%2B5)%C2%A65)%2B15%C3%97((m%2B4)%C2%A65)%2B150%C3%97((m%2B3)%C2%A65)%2B530%C3%97((m%2B2)%C2%A65)%2B1230%C3%97((m%2B1)%C2%A65)%2B+++++++1590%C3%97(m%C2%A65)+%0D%0Adengan+N(%E3%80%96G'%E3%80%97_(6%2Cm)+)+adalah+jumlah+graf+tak+terhubung+berlabel+titik+tanpa+garis+paralel+untuk+n%3D6+dan+m%E2%89%A51%0D%0A%0D%0AKata+kunci%3A+graf%2C+graf+terhubung%2C+loop%2C+garis+paralel+%0D%0A%0D%0A%0D%0AABSTRACT%0D%0A%0D%0AA+graph+G(V%2CE)+is+connected+if+there+exists+at+least+one+path+between+every+pair+of%0D%0Avertices+in+G%2C+otherwise%2C+G+is+disconnected.+A+graph+is+called+labelled+graph+if+each+vertex+or+each+edge+is+assigned+a+label+or+unique+name+(i.e.%2C+no+two+vertices+or+two+edges+have+the+same+labels).+Loop+is+an+edge+that+has+the+same+initial+and+end+point.+Parallel+edges+are+two+or+more+edges+that+connect+the+same+vertices.+If+given+n+vertices+and+m+edges%2C+there+are+many+possible+graphs+that+can+be+formed+either+connected+or+disconnected%2C+simple+or+not+simple.+In+this+research%2C+we+discussed+about+how+to+determine+and+to+count+the+number+of+disconnected+vertex+labelled+graphs+without+parallel+edges+with+order+six+and+the+number+of+edges+m+%E2%89%A5+1.+The+result+is+%3A%0D%0AN(%E3%80%96G'%E3%80%97_(6%2Cm)+)%3D+N(%E3%80%96G'(l)%E3%80%97_(6%2Cm)+)%2B%E2%88%91_(g%3D1)%5E10%E2%96%92%E3%80%96N(%E3%80%96G'%E3%80%97_(6%2Cm%2Cl%2Cg))%E3%80%97+%0D%0A%3D((m%2B5)%C2%A65)%2B15%C3%97((m%2B4)%C2%A65)%2B150%C3%97((m%2B3)%C2%A65)%2B530%C3%97((m%2B2)%C2%A65)%2B1230%C3%97((m%2B1)%C2%A65)%2B+1590%C3%97(m%C2%A65)+%0D%0AN(%E3%80%96G'%E3%80%97_(6%2Cm)+)++is+the+number+of+disconnected+vertex+labelled+graph+without+parallel+edges+for+n%3D6+and+m%E2%89%A51%0D%0A%0D%0AKeyword%3A+graph%2C+disconnected+graph%2C+loop%2C+and+parallel+edges%0D%0A&rft.publisher=FAKULTAS+MATEMATIKADAN+ILMU+PENGETAHUAN+ALAM&rft.date=2016-09-16&rft.type=Skripsi&rft.type=NonPeerReviewed&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F24217%2F1%2FABSTRAK%2520%2528ABSTRACT%2529.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F24217%2F3%2FSKRIPSI%2520FULL.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F24217%2F2%2FSKRIPSI%2520TANPA%2520BAB%2520PEMBAHASAN.pdf&rft.identifier=++PRISKY+PARADITTA+%2C+1217031050++(2016)+PENENTUAN+BANYAKNYA+GRAF+TAK+TERHUBUNG+BERLABEL+TITIK+TANPA+GARIS+PARALEL+DENGAN+BANYAKNYA+TITIK+n+%3D+6+DAN+BANYAKNYA+GARIS+m+%E2%89%A5+1.++FAKULTAS+MATEMATIKADAN+ILMU+PENGETAHUAN+ALAM%2C+UNIVERSITAS+LAMPUNG.+++++&rft.relation=http%3A%2F%2Fdigilib.unila.ac.id%2F24217%2F