Please use this identifier to cite or link to this item: https://repository.unej.ac.id/xmlui/handle/123456789/80129
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDafik-
dc.contributor.authorAgustin, I.H.-
dc.date.accessioned2017-05-18T08:36:10Z-
dc.date.available2017-05-18T08:36:10Z-
dc.date.issued2017-05-18-
dc.identifier.urihttp://repository.unej.ac.id/handle/123456789/80129-
dc.descriptionFKIP Universitas Jember Jl. Kalimantan 37 Jemberen_US
dc.description.abstractIn graph theory perspective, the communication and transport networks can be represented as a graph where each element is described as a point and the connection between the two elements is described as an edge. There are a lot of problem that can be modelled as a graph such as communication network, transportation delivery system design. One of graph study which can be used to solve those problems is a Rainbow Connection. Let c be a coloring c : E(G) →{1, 2, . . . , k}, 𝑘𝜖𝑁, of a nontrivial, finite, simple and undirected connected graph G=(V,E). A rainbow is an edge colored graph in which to edges on the path have different colors. An edge colored graph G is rainbow connected if there exists a rainbow u - v path for every two vertices u and v of G. The smallest number of k colors required to edge color the graph such that the graph is rainbow connected is called a rainbow connection number of a graph G, denoted by rc(G). To determine the rainbow connection number for any graph is considered to be a hard problem. Suppose we are given an edge coloring of the graph. How are we convinced whether the colored graph is rainbow connected. Clearly, if the number of colors is constant then this problem becomes easy. However, if it has an unbounded number of colors, the problem becomes NP-Complete. In this paper, we determine the exact values of rainbow connection number of some special graphs and its operations. The result shows that all exact values of rc(G) studied in this paper attain a lower bound of the rainbow connectivity.en_US
dc.description.sponsorshipPenelitian Hibah Fundamental 2016en_US
dc.language.isoiden_US
dc.relation.ispartofseriesPenelitian Hibah Fundamental;2016-
dc.subjectrainbow connectionen_US
dc.subjectstrong rainbow connectionen_US
dc.subjectrainbow connection numberen_US
dc.subjectstrong rainbow connection numberen_US
dc.subjectgraphen_US
dc.titlePENERAPAN TEKNIK RAINBOW CONNECTION DALAM PENGEMBANGAN DELIVERY DESIGN SYSTEM YANG AMAN PADA JARINGAN TRANSPORTASI DAN KOMUNIKASI (The Application of Rainbow Connection Technique in Developing a Secured Delivery Design System of Transportation and Communication Network)en_US
dc.typeOtheren_US
Appears in Collections:LRR-Hibah Fundamental

Files in This Item:
File Description SizeFormat 
aBSTRAK_dAFIK_hI-fUNDAMENATL_2016.pdf367.48 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.