Now showing items 1-1 of 1

    • On the total rainbow connection of the wheel related graphs 

      M.S Hasan; Slamin, Slamin; Dafik, Dafik; Agustin, Ika Hesti; Alfarisi, Ridho (2018-07-04)
      Let G = (V (G); E(G)) be a nontrivial connected graph with an edge coloring c : E(G) ! f1; 2; :::; lg; l 2 N, with the condition that the adjacent edges may be colored by the same colors. A path P in G is called rainbow ...