dc.contributor.advisor | Siswandi | |
dc.contributor.advisor | Aliatiningtyas, Nur | |
dc.contributor.author | Hartatik, Lela Fuji | |
dc.date.accessioned | 2021-08-09T02:56:56Z | |
dc.date.available | 2021-08-09T02:56:56Z | |
dc.date.issued | 2021 | |
dc.identifier.uri | http://repository.ipb.ac.id/handle/123456789/108245 | |
dc.description.abstract | Suatu Graf G dapat dikatakan memiliki pelabelan komposit jika graf tersebut memenuhi fungsi bijektif f:(V(G)UE(G))→{1,2,3,…,m+n} dan gcd(f(uv),f(vw))≠1 dengan n adalah banyaknya verteks, m banyaknya sisi, dan u,v,w∈V(G). Graf yang memiliki pelabelan komposit disebut graf komposit. Dalam karya ilmiah ini, akan ditunjukan bahwa tree, cycle, dan graf tangga memiliki pelabelan komposit. | id |
dc.description.abstract | A Graph G=(V(G),E(G)) can be said to have composite labeling if the graph fulfills the function of f:(V(G)UE(G))→{1,2,3,…,m+n} and gcd(f(uv),f(vw))≠1 with order n, size m, and u,v,w∈V(G). A graph that admits composite labelling is know as a composite graph. This papper shows that the tree, cycle, and the ladder graph have composite labeling. | id |
dc.language.iso | id | id |
dc.publisher | IPB University | id |
dc.title | Pelabelan Komposit Pada Tree, Cycle, dan Graf Tangga. | id |
dc.type | Undergraduate Thesis | id |
dc.subject.keyword | Tree | id |
dc.subject.keyword | cycle | id |
dc.subject.keyword | Ladder graph | id |
dc.subject.keyword | Composite Labeling | id |