Please use this identifier to cite or link to this item:
http://repository.ipb.ac.id/handle/123456789/108245
Title: | Pelabelan Komposit Pada Tree, Cycle, dan Graf Tangga. |
Authors: | Siswandi Aliatiningtyas, Nur Hartatik, Lela Fuji |
Issue Date: | 2021 |
Publisher: | IPB University |
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. 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. |
URI: | http://repository.ipb.ac.id/handle/123456789/108245 |
Appears in Collections: | UT - Mathematics |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
G54160038_Lela Fuji Hartatik.pdf Restricted Access | fulltext | 1.02 MB | Adobe PDF | View/Open |
Cover.pdf | Cover | 278.81 kB | Adobe PDF | View/Open |
G54160038_Lela Fuji Hartatik-.pdf Restricted Access | Fullteks | 8.5 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.