Rainbow Connection Number on Amalgamation of General Prism Graph
Abstract Let be a nontrivial connected graph, the rainbow-k-coloring of graph G is the mapping of c: E(G)-> {1,2,3,…,k} such that any two vertices from the graph can be connected by a rainbow path (the path with all edges of different colors). The least natural number
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
UIN Syarif Hidayatullah
2019-12-01
|
| Series: | InPrime |
| Online Access: | https://journal.uinjkt.ac.id/index.php/inprime/article/view/12732 |