<> <http://www.w3.org/2000/01/rdf-schema#comment> "The repository administrator has not yet configured an RDF license."^^<http://www.w3.org/2001/XMLSchema#string> .
<> <http://xmlns.com/foaf/0.1/primaryTopic> <http://digilib.unila.ac.id/id/eprint/54329> .
<http://digilib.unila.ac.id/id/eprint/54329> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Article> .
<http://digilib.unila.ac.id/id/eprint/54329> <http://purl.org/dc/terms/title> "PENENTUAN BANYAKNYA GRAF TERHUBUNG BERLABEL TITIK BERORDE LIMA DENGAN GARIS PARALEL ATAU LOOP MAKSIMAL DUA"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://digilib.unila.ac.id/id/eprint/54329> <http://purl.org/ontology/bibo/abstract> "ABSTRAK\r\n\r\n\r\nPenentuan Banyaknya Graf Terhubung Berlabel Titik Berorde Lima dengan Garis Paralel atau Loop Maksimal Dua\r\n\r\nOleh\r\n\r\n\r\n\r\nDracjat Indrawan\r\n\r\n\r\n\r\nGraf G(V,E) disebut graf terhubung (connected graph) jika terdapat sekurang-kurangnya ada satu path yang menghubungkan sepasang titik di G.  Jika ada n titik dan m garis maka banyak graf terbentuk, baik yang terhubung atau tak terhubung. Dalam penelitian ini akan dibahas tentang formula untuk menentukan banyaknya graf terhubung berlabel titik dengan garis paralel atau loop maksimal dua jika diberikan n=5 dan m≥4. Notasikan g sebagai banyaknya garis yang menghubungkan pasangan titik yang berbeda dan N(〖 G〗_(n,m,g)) adalah banyaknya graf terhubung berorde 5 dengan m garis dan g. Dari hasil penelitian diperoleh rumus sebagai berikut :\r\n\r\n\tN(G_(5,m,4) )=125/2 (m-3)(7m^2-56m+114)\r\n\tN(G_(5,m,5) )=37/4 (m-3)(m-4)(21m^2-203m+502)\r\n\tN(G_(5,m,6) )=41/24 (m-3)(m-4)(m-5)(21m^2-238m+692)\r\n\tN(G_(5,m,7) )=11/24 (m-3)(m-4)(m-5)(m-6)(7m^2-91m+304)\r\n\tN(G_(5,m,8) )=1/16 (m-3)(m-4)(m-5)(m-6)(m-7)(3m^2-44m+166)\r\n\tN(G_(5,m,9) )=1/576 (m-3)(m-4)(m-5)(m-6)(m-7)(m-8)(3m^2-49m\r\n+206)\r\n\tN(G_(5,m,10) )=1/120960 (m-3)(m-4)(m-5)(m-6)(m-7)(m-8)\r\n(m-9)(7m^2-126m+584)\r\n\r\nKata Kunci : graf, graf terhubung, loop, garis paralel\r\n"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://digilib.unila.ac.id/id/eprint/54329> <http://purl.org/dc/terms/date> "2018-09-27" .
<http://digilib.unila.ac.id/id/document/1877068> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Document> .
<http://digilib.unila.ac.id/id/document/1877069> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Document> .
<http://digilib.unila.ac.id/id/document/1877070> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Document> .
<http://digilib.unila.ac.id/id/org/ext-f344d49c7bcdf82c8224cea2083075f8> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Organization> .
<http://digilib.unila.ac.id/id/org/ext-f344d49c7bcdf82c8224cea2083075f8> <http://xmlns.com/foaf/0.1/name> "Universitas Lampung"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://digilib.unila.ac.id/id/eprint/54329> <http://purl.org/dc/terms/publisher> <http://digilib.unila.ac.id/id/org/ext-f344d49c7bcdf82c8224cea2083075f8> .
<http://digilib.unila.ac.id/id/eprint/54329> <http://purl.org/ontology/bibo/status> <http://purl.org/ontology/bibo/status/published> .
<http://digilib.unila.ac.id/id/eprint/54329> <http://purl.org/dc/terms/creator> <http://digilib.unila.ac.id/id/person/ext-dracjat@gmail.com> .
<http://digilib.unila.ac.id/id/eprint/54329> <http://purl.org/ontology/bibo/authorList> <http://digilib.unila.ac.id/id/eprint/54329#authors> .
<http://digilib.unila.ac.id/id/eprint/54329#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_1> <http://digilib.unila.ac.id/id/person/ext-dracjat@gmail.com> .
<http://digilib.unila.ac.id/id/person/ext-dracjat@gmail.com> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<http://digilib.unila.ac.id/id/person/ext-dracjat@gmail.com> <http://xmlns.com/foaf/0.1/givenName> "1417031043"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://digilib.unila.ac.id/id/person/ext-dracjat@gmail.com> <http://xmlns.com/foaf/0.1/familyName> "DRACJAT INDRAWAN"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://digilib.unila.ac.id/id/person/ext-dracjat@gmail.com> <http://xmlns.com/foaf/0.1/name> "1417031043 DRACJAT INDRAWAN"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://digilib.unila.ac.id/id/eprint/54329> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/EPrint> .
<http://digilib.unila.ac.id/id/eprint/54329> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/OtherEPrint> .
<http://digilib.unila.ac.id/id/eprint/54329> <http://purl.org/dc/terms/isPartOf> <http://digilib.unila.ac.id/id/repository> .
<http://digilib.unila.ac.id/id/eprint/54329> <http://eprints.org/ontology/hasDocument> <http://digilib.unila.ac.id/id/document/1877068> .
<http://digilib.unila.ac.id/id/document/1877068> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<http://digilib.unila.ac.id/id/document/1877068> <http://www.w3.org/2000/01/rdf-schema#label> "PENENTUAN BANYAKNYA GRAF TERHUBUNG BERLABEL TITIK BERORDE LIMA DENGAN GARIS PARALEL ATAU LOOP MAKSIMAL DUA (File PDF)"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://digilib.unila.ac.id/id/document/1877068> <http://eprints.org/ontology/hasFile> <http://digilib.unila.ac.id/54329/1/Abstrak%20.pdf> .
<http://digilib.unila.ac.id/id/document/1877068> <http://purl.org/dc/terms/hasPart> <http://digilib.unila.ac.id/54329/1/Abstrak%20.pdf> .
<http://digilib.unila.ac.id/54329/1/Abstrak%20.pdf> <http://www.w3.org/2000/01/rdf-schema#label> "Abstrak .pdf"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://digilib.unila.ac.id/id/eprint/54329> <http://eprints.org/ontology/hasDocument> <http://digilib.unila.ac.id/id/document/1877069> .
<http://digilib.unila.ac.id/id/document/1877069> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<http://digilib.unila.ac.id/id/document/1877069> <http://www.w3.org/2000/01/rdf-schema#label> "PENENTUAN BANYAKNYA GRAF TERHUBUNG BERLABEL TITIK BERORDE LIMA DENGAN GARIS PARALEL ATAU LOOP MAKSIMAL DUA (File PDF)"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://digilib.unila.ac.id/id/eprint/54329> <http://eprints.org/ontology/hasDocument> <http://digilib.unila.ac.id/id/document/1877070> .
<http://digilib.unila.ac.id/id/document/1877070> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<http://digilib.unila.ac.id/id/document/1877070> <http://www.w3.org/2000/01/rdf-schema#label> "PENENTUAN BANYAKNYA GRAF TERHUBUNG BERLABEL TITIK BERORDE LIMA DENGAN GARIS PARALEL ATAU LOOP MAKSIMAL DUA (File PDF)"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://digilib.unila.ac.id/id/document/1877070> <http://eprints.org/ontology/hasFile> <http://digilib.unila.ac.id/54329/3/SKRIPSI%20TANPA%20PEMBAHASAN.pdf> .
<http://digilib.unila.ac.id/id/document/1877070> <http://purl.org/dc/terms/hasPart> <http://digilib.unila.ac.id/54329/3/SKRIPSI%20TANPA%20PEMBAHASAN.pdf> .
<http://digilib.unila.ac.id/54329/3/SKRIPSI%20TANPA%20PEMBAHASAN.pdf> <http://www.w3.org/2000/01/rdf-schema#label> "SKRIPSI TANPA PEMBAHASAN.pdf"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://digilib.unila.ac.id/id/eprint/54329> <http://www.w3.org/2000/01/rdf-schema#seeAlso> <http://digilib.unila.ac.id/54329/> .
<http://digilib.unila.ac.id/54329/> <http://purl.org/dc/elements/1.1/title> "HTML Summary of #54329 \n\nPENENTUAN BANYAKNYA GRAF TERHUBUNG BERLABEL TITIK BERORDE LIMA DENGAN GARIS PARALEL ATAU LOOP MAKSIMAL DUA\n\n" .
<http://digilib.unila.ac.id/54329/> <http://purl.org/dc/elements/1.1/format> "text/html" .
<http://digilib.unila.ac.id/54329/> <http://xmlns.com/foaf/0.1/primaryTopic> <http://digilib.unila.ac.id/id/eprint/54329> .
<http://digilib.unila.ac.id/id/subject/QA> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.w3.org/2004/02/skos/core#Concept> .
<http://digilib.unila.ac.id/id/subject/QA> <http://www.w3.org/2004/02/skos/core#prefLabel> "QA Mathematics"@en .
<http://digilib.unila.ac.id/id/eprint/54329> <http://purl.org/dc/terms/subject> <http://digilib.unila.ac.id/id/subject/QA> .