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
References
R. Trudeau, Introduction to Graph Theory, New York: Dover Publication, Inc., 1994.
A. Rosa, "On Certain Valuations of the Vertices of a Graph," in Theory of Graphs, Int. Symp. Rome July 1966, Gordon and Breach, 1967.
G. Chartrand, G. Johns, K. McKeon and P. Zhang, "Rainbow Connection in Graphs," Math Bohem, vol. 133, no. 1, pp. 85 - 98, 2008.
I. Kumala and A. Salman, "The Rainbow Connection Number of a Flower (C_m,K_n) Graph and a Flower (C_3,F_n) Graph," Procedia Computer Science, vol. 74, pp. 168 - 172, 2015.
R. Darmawan, "Analisis Rainbow Connection Number pada Graf Khusus dan Hasil Operasinya. Thesis," Pascasarjana Universitas Jember, 2015.
C. Palupi, W. Aribowo, Y. Irene and I. Hasanah, "On Rainbow Connection and Strong Rainbow Connection Number from Amalgamation of Prism Graph P_3,2," Journal Of Physics: Conference Series, vol. 1008(1), 2018.
D. Fitriani and A.N.M. Salman, "Rainbow Connection Number of Amalgamation of some Graphs," AKCE International Journal of Graphs and Combinatorics , vol. 13, pp. 90 - 99, 2016.
K. Sugeng, S. Surjadi and R. Denny, Teori Graf dan Aplikasinya, Depok: Department of Mathematics FMIPA University of Indonesia, 2014.
K. Rosen, Discrete Mathematics and Its Applications, New York: Mac Graw-Hill, inc, 2012.
N. Hartsfield and G. Ringel, Pearls in Graph Theory, New Yotk: Dover Publications, Inc, 1994.
G. Chartrand and O. R. Oellermann, Applied and Algorithmic Graph Theory, New York: McGraw-Hill, 1993.
DOI: 10.15408/inprime.v1i1.12732
Refbacks
- There are currently no refbacks.
.
