?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=PENENTUAN+BANYAKNYA+GRAF+TERHUBUNG+BERLABEL+TITIK%0D%0ABERORDE+ENAM+DENGAN+MAKSIMAL+LIMA+BELAS%0D%0AGARIS+2-PARALEL&rft.creator=Gusti+Sayu+Putu+Widya+Sasti%2C+1517031022&rft.subject=510+Matematika&rft.description=A+graph+G+is+connected+graph+if+there+exists+at+least+one+path+between+every+pair%0D%0Aof+vertices+in+G.+A+labelled+graph+is+the+assignment+of+values+or+label+at+each%0D%0Avertex+or+each+edge.+The+label+given+at+each+vertex+called+vertex+labeling%2C+the%0D%0Alabel+given+on+each+edge+is+called+the+edge+labeling+%2C+and+if+the+label+is+given+on%0D%0Aeach+edge+and+vertex+is+called+total+labeling.+Paralel+lines+are+two+or+more+line%0D%0Awhose+starting+point+and+end+point+are+the+same.+If+given+n+vertex+and+m+edge%0D%0Athen+many+connected+graphs+can+be+formed.+In+this+research+obtained+the+formula%0D%0Afor+counting+the+number+of+vertex+labeled+connected+graphs+with+order+six+with%0D%0Amaximal+fifteen+4-parallel+edges.%0D%0AKeywords%3A+graph%2C+connected+graph%2C+labeled+graph%2C+and+parallel+lines%0D%0ASuatu+graf+G+disebut+graf+terhubung+jika+terdapat+sekurang+%E2%80%93+kurangnya+ada+satu%0D%0Apath+yang+menghubungkan+sepasang+titik+di+G.+Graf+berlabel+merupakan+graf%0D%0Ayang+setiap+titik+atau+garisnya+diberi+label.+Label+yang+diberikan+pada+tiap+titik%0D%0Adisebut+sebagai+pelabelan+titik%2C+label+yang+diberikan+pada+tiap+garis+disebut%0D%0Apelabelan+garis%2C+dan+jika+label+diberikan+pada+tiap+garis+dan+titik+disebut+sebagai%0D%0Apelabelan+total.+Garis+paralel+adalah+dua+garis+atau+lebih+yang+titik+awal+dan+titik%0D%0Aakhirnya+sama.+Jika+diberikan+n+titik+dan+m+garis+maka+banyak+graf+terhubung%0D%0Adapat+dibentuk.+Pada+penelitian+ini+diperoleh+rumus+untuk+menghitung+banyaknya%0D%0Agraf+terhubung+berlabel+titik+berorde+enam+dengan+maksimal+lima+belas+garis+2-%0D%0Aparalel.%0D%0AKata+Kunci+%3A+graf%2C+graf+terhubung%2C+graf+berlabel+dan+garis+paralel&rft.publisher=FAKULTAS+MATEMATIKA+DAN+ILMU+PENGETAHUAN+ALAM&rft.date=2019&rft.type=Skripsi&rft.type=NonPeerReviewed&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F59438%2F1%2FABSTRAK.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F59438%2F2%2FSKRIPSI%2520FULL.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F59438%2F3%2FSKRIPSI%2520TANPA%2520BAB%2520PEMBAHSAN.pdf&rft.identifier=++Gusti+Sayu+Putu+Widya+Sasti%2C+1517031022++(2019)+PENENTUAN+BANYAKNYA+GRAF+TERHUBUNG+BERLABEL+TITIK+BERORDE+ENAM+DENGAN+MAKSIMAL+LIMA+BELAS+GARIS+2-PARALEL.++FAKULTAS+MATEMATIKA+DAN+ILMU+PENGETAHUAN+ALAM%2C+UNIVERSITAS+LAMPUNG.+++++&rft.relation=http%3A%2F%2Fdigilib.unila.ac.id%2F59438%2F