?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=DIMENSI+PARTISI+GRAF+PETERSEN+DIPERUMUM+&rft.creator=NIA+ADELIA%2C+1517031141&rft.subject=QA+Mathematics&rft.description=Let+G+be+a+connected+graph+G+%3D+(V%2C+E)%2C+with+V(G)+%E2%89%A0+denotes+the+set+of+vertex+and%0D%0AE(G)+denotes+the+set+of+edge.+The+distance+v+to+S+for+v+(G)+and+S+%E2%8A%82+V(G)+is%0D%0Adefined+as+d(v%2CS)+%3D+min%7Bd(v%2Cx)%2C+x+%7D.+For+an+ordered+k-partition+%CE%A0+%3D%0D%0A+of%0D%0Av+(G)%2C+then+representation+of+v+with+respect+to+%CE%A0+is+defined+as+the+k-vector+r(v%7C%CE%A0)%0D%0A%3D+(d(v%2C+)%2C+d(v%2C+)%2C%E2%80%A6.%2C+d(v%2C+)).+The+partition+%CE%A0+is+called+a+resolving+partition+if+the%0D%0Ak-vectors+r(v%7C%CE%A0)+are+distinct.+The+minimum+for+which+there+is+a+resolving+k-partition%0D%0Aof+(G)+is+the+partition+dimension+pd(G)+of+G.+In+this+study%2C+the+partition+dimension%0D%0Aof+generalized+Petersen+graph+&rft.publisher=FAKULTAS+MATEMATIKA+DAN+ILMU+PENGETAHUAN+ALAM&rft.date=2019-05-31&rft.type=Skripsi&rft.type=NonPeerReviewed&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F54397%2F1%2F1.%2520ABSTRAK.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F54397%2F2%2F2.%2520SKRIPSI%2520FULL.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F54397%2F3%2F3.%2520SKRIPSI%2520FULL%2520TANPA%2520BAB%2520PEMBAHASAN.pdf&rft.identifier=++NIA+ADELIA%2C+1517031141++(2019)+DIMENSI+PARTISI+GRAF+PETERSEN+DIPERUMUM.++FAKULTAS+MATEMATIKA+DAN+ILMU+PENGETAHUAN+ALAM%2C+UNIVERSITAS+LAMPUNG.+++++&rft.relation=http%3A%2F%2Fdigilib.unila.ac.id%2F54397%2F