Browsing LSP-Jurnal Ilmiah Dosen by Subject "Rainbow k-Connection Number"
Now showing items 1-1 of 1
(2018-02-28)Let G = (V; E) be a simple, nontrivial, nite, connected and undirected graph. Let c be a coloring c : E(G) ! f1; 2; : : : ; sg; s 2 N. A path of edge colored graph is said to be a rainbow path if no two edges on the ...