Please use this identifier to cite or link to this item: https://repository.unej.ac.id/xmlui/handle/123456789/112517
Full metadata record
DC FieldValueLanguage
dc.contributor.authorM, Agustina-
dc.contributor.authorDAFIK, Dafik-
dc.contributor.authorSLAMIN, Slamin-
dc.contributor.authorKUSBUDIONO, Kusbudiono-
dc.date.accessioned2023-03-03T07:04:36Z-
dc.date.available2023-03-03T07:04:36Z-
dc.date.issued2017-08-08-
dc.identifier.urihttps://repository.unej.ac.id/xmlui/handle/123456789/112517-
dc.description.abstractBy an edge comb, we mean a graph formed by combining two graphs G and H, where each edge of graph G is replaced by the which one edge of graph H, denote by G D H. A vertex colored graph G D H = (V (G D H), E(G D H)) is said rainbow vertex-connected, if for every two vertices u and v in V (G D H), there is a u − v path with all internal vertices have distinct color. The rainbow vertex connection number of G D H, denoted by rvc(G D H) is the smallest number of color needed in order to make G D H rainbow vertex-connected. This research aims to find an exact value of the rainbow vertex connection number of exponential graph, namely rvc(G D H) when G D H are Pn D Btm, Sn D Btm, Ln D Btm, Fm,n D Btp, rvc(Pn D Sm), rvc(Cn D Sm), and rvc(Wn D Sm) Wn D Btm. The result shows that the resulting rainbow vertex connection attain the given lower bounden_US
dc.language.isoenen_US
dc.publisherProceeding The 1st IBSC: Towards The Extended Use Of Basic Science For Enhancing Health, Environment, Energy And Biotechnologyen_US
dc.subjectRainbow vertex connection coloringen_US
dc.subjectrvc numberen_US
dc.subjectedge comben_US
dc.titleOn the Rainbow Vertex Connection Number of Edge Comb of Some Graphen_US
dc.typeArticleen_US
Appears in Collections:LSP-Conference Proceeding

Files in This Item:
File Description SizeFormat 
FMIPA_On the Rainbow Vertex Connection Number of Edge Comb of Some Grap.pdf5.5 MBAdobe PDFView/Open


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