Now showing items 1-1 of 1

    • On the Rainbow Vertex Connection Number of Edge Comb of Some Graph 

      M, Agustina; DAFIK, Dafik; SLAMIN, Slamin; KUSBUDIONO, Kusbudiono (Proceeding The 1st IBSC: Towards The Extended Use Of Basic Science For Enhancing Health, Environment, Energy And Biotechnology, 2017-08-08)
      By 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)) ...