Show simple item record

dc.contributor.authorPRIHANDINI, Rafiantika Megahnia
dc.contributor.authorADAWIYAH, Robiatul
dc.contributor.authorKRISTIANA, Arika Indah
dc.contributor.authorDAFIK, Dafik
dc.contributor.authorFATAHILLAH, Arif
dc.contributor.authorALBIRRI, Ermita Rizki
dc.date.accessioned2021-04-15T01:28:15Z
dc.date.available2021-04-15T01:28:15Z
dc.date.issued2020-12-04
dc.identifier.urihttp://repository.unej.ac.id/handle/123456789/104071
dc.description.abstractAn elegant labeling on the graph G with n vertex and m edge is a one-to-one mapping (injection function) of the vertex set V (G) to the set of non negative integers {0, 1, 2, 3, . . . , m} such that each edge gets the label of the sum from the adjacent vertex label in modulo number (m+1) all different and nonzero, that is: g(e) = g(uv) = [g(u)+g(v)] mod (m+ 1) and g(e) 6= 0, where u and v are adjacent vertices. In this research, we investigate the elegant labelling of selected graph from some families of tree. A tree graph is a graph that does not contain a circle. The selected some families of tree are generalized of star and amalgamation of star. The results of this research have shown that some families of tree graph are eleganten_US
dc.language.isoenen_US
dc.publisherAdvances in Mathematics: Scientific Journal 9en_US
dc.subjectSome Families of Tree Are Eleganten_US
dc.titleSome Families of Tree Are Eleganten_US
dc.typeArticleen_US
dc.identifier.kodeprodiKODEPRODI0210191#Pendidikan Matematika
dc.identifier.nidnNIDN0005108905
dc.identifier.nidnNIDN0031079201
dc.identifier.nidnNIDN0002057606
dc.identifier.nidnNIDN0001016827
dc.identifier.nidnNIDN0029058204
dc.identifier.nidnNIDN0027029201


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record