?url_ver=Z39.88-2004&rft_id=1617031058&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=PENENTUAN+BANYAKNYA+GRAF+TAK+TERHUBUNG%0D%0ABERLABEL+TITIK+BERORDE+ENAM+MEMUAT+LOOP%0D%0AMAKSIMAL+TUJUH+TANPA+GARIS+PARALEL&rft.creator=AYU+%2C+LESTARI&rft.subject=500+ilmu+pengetahuan+alam+dan+matematika&rft.subject=510+Matematika&rft.description=Graf+berlabel+adalah+graf+yang+setiap+garisnya+diberikan+sebagai+nilai+atau+label.+Graf+G+disebut+graf+terhubung+jika+untuk+tiap+pasangan+titik+di+G+terdapat+lintasan+yang+menghubungkannya.+Jika+tidak+maka+disebut+graf+tak+terhubung.+Suatu+garis+yang+titik+awal+dan+titik+akhirnya+sama+disebut+loop.+Garis+paralel+adalah+dua+garis+atau+lebih+yang+menghubungkan+pasangan+titik+yang+sama.+Graf+sederhana+adalah+graf+yang+tidak+memuat+loop+atau+garis+paralel.+Graf+dengan+jumlah+titik+n+dan+garis+m+tentunya+memiliki+banyak+bentuk+yang+berbeda-beda%2C+sehingga+pada+penelitian+ini+akan+dilakukan+penelitian+tentang+graf+tak+terhubung+berlabel+titik+berorde+enam+tanpa+garis+paralel+dengan+loop+maksimal+tujuh.+Pada+penelitian+ini+diperoleh+rumus+untuk+menentukan+graf+tak+terhubung+berlabel+titik+berorde+enam+tanpa+garis+paralel+dengan+loop+maksimal+tujuh+sebagai+berikut+%3A+(+)+%CE%A3%0D%0A(+)+(+)+(+)+(+)+(+)+(+)+(+)+(+)%0D%0A%0D%0AKata+kunci+%3A+graf%2C+graf+terhubung+dan+tak+terhubung%2C+loop+dan+garis+parale.%0D%0A%0D%0A%0D%0A%0D%0A%0D%0A%0D%0A%0D%0A%0D%0A%0D%0Aabstract%0D%0A%0D%0AA+labeled+graph+is+a+graph+where+each+edge+is+assigned+a+value+or+label.+Graph+G+is+called+a+connected+graph+if+there+is+a+path+connecting+every+pair+of+vertices+in+G%2C+if+not+then+G+is+disconnected.+An+edge+with+the+same+start+and+end+points+is+called+a+loop.+Parallel+edges+are+two+or+more+edges+connecting+the+same+pair+of+vartices.+A+simple+graph+is+a+graph+that+does+not+contain+loops+or+parallel+edge.+Graphs+with+n+points+and+m+edges+certainly+have+many+different+forms%2C+so+in+this+research+will+be+discussed+the+formula+for+counting+disconnected+vertex+labeled+graphs+of+order+six+without+parallel+edges+with+a+maximum+of+seven+loops.+In+this+research%2C+the+formula+for+determining+a+disconnected+graph+labeled+vertex+of+orther+six+without+parallel+edges+with+a+maximum+of+seven+loops+is+obtained+as+follows%3A+(+)+%CE%A3%0D%0A(+)+(+)+(+)+(+)+(+)+(+)+(+)+(+)+(+)+(+)%0D%0A%0D%0AKeywords%3A+Graph%2C+Connected+and+Disconnected+Graph%2C+Loops+and+Parallel+Edges&rft.publisher=FAKULTAS+MATEMATIKA+DAN+ILMU+PENGETAHUAN+ALAM+&rft.date=2023-06-19&rft.type=Skripsi&rft.type=NonPeerReviewed&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F76178%2F1%2FABSTRAK.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F76178%2F2%2FSKRIPSI%2520FULL.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F76178%2F3%2FSKRIPSI%2520TANPA%2520BAB%2520PEMBAHASAN.pdf&rft.identifier=++AYU+%2C+LESTARI++(2023)+PENENTUAN+BANYAKNYA+GRAF+TAK+TERHUBUNG+BERLABEL+TITIK+BERORDE+ENAM+MEMUAT+LOOP+MAKSIMAL+TUJUH+TANPA+GARIS+PARALEL.++FAKULTAS+MATEMATIKA+DAN+ILMU+PENGETAHUAN+ALAM+%2C+UNIVERSITAS+LAMPUNG.+++++&rft.relation=http%3A%2F%2Fdigilib.unila.ac.id%2F76178%2F